java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:27:45,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:27:45,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:27:45,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:27:45,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:27:45,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:27:46,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:27:46,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:27:46,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:27:46,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:27:46,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:27:46,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:27:46,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:27:46,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:27:46,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:27:46,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:27:46,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:27:46,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:27:46,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:27:46,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:27:46,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:27:46,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:27:46,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:27:46,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:27:46,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:27:46,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:27:46,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:27:46,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:27:46,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:27:46,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:27:46,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:27:46,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:27:46,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:27:46,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:27:46,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:27:46,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:27:46,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:27:46,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:27:46,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:27:46,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:27:46,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:27:46,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:27:46,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:27:46,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:27:46,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:27:46,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:27:46,047 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:27:46,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:27:46,047 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:27:46,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:27:46,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:27:46,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:27:46,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:27:46,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:27:46,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:27:46,048 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:27:46,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:27:46,049 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:27:46,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:27:46,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:27:46,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:27:46,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:27:46,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:27:46,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:27:46,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:27:46,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:27:46,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:27:46,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:27:46,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:27:46,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:27:46,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:27:46,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:27:46,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:27:46,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:27:46,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:27:46,341 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:27:46,342 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i [2019-10-06 23:27:46,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff44fa1b/448481b1b777488bba49e997a1fe0020/FLAG9486ed076 [2019-10-06 23:27:46,841 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:27:46,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i [2019-10-06 23:27:46,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff44fa1b/448481b1b777488bba49e997a1fe0020/FLAG9486ed076 [2019-10-06 23:27:47,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ff44fa1b/448481b1b777488bba49e997a1fe0020 [2019-10-06 23:27:47,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:27:47,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:27:47,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:27:47,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:27:47,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:27:47,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4e377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47, skipping insertion in model container [2019-10-06 23:27:47,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,269 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:27:47,284 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:27:47,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:27:47,452 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:27:47,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:27:47,494 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:27:47,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47 WrapperNode [2019-10-06 23:27:47,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:27:47,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:27:47,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:27:47,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:27:47,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... [2019-10-06 23:27:47,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:27:47,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:27:47,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:27:47,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:27:47,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:27:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:27:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:27:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:27:47,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:27:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:27:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:27:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:27:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:27:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:27:47,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:27:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:27:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:27:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:27:47,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:27:48,073 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:27:48,074 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:27:48,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:27:48 BoogieIcfgContainer [2019-10-06 23:27:48,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:27:48,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:27:48,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:27:48,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:27:48,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:27:47" (1/3) ... [2019-10-06 23:27:48,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba027f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:27:48, skipping insertion in model container [2019-10-06 23:27:48,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:47" (2/3) ... [2019-10-06 23:27:48,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba027f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:27:48, skipping insertion in model container [2019-10-06 23:27:48,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:27:48" (3/3) ... [2019-10-06 23:27:48,084 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_allDiff2_ground.i [2019-10-06 23:27:48,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:27:48,102 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:27:48,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:27:48,138 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:27:48,139 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:27:48,139 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:27:48,139 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:27:48,139 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:27:48,139 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:27:48,139 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:27:48,139 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:27:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-06 23:27:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:27:48,160 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:48,161 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:48,163 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash -145704838, now seen corresponding path program 1 times [2019-10-06 23:27:48,175 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:48,175 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:48,176 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:48,176 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:27:48,335 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:48,336 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:27:48,336 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:27:48,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:27:48,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:27:48,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:27:48,357 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-06 23:27:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:48,423 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-10-06 23:27:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:27:48,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:27:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:48,434 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:27:48,434 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:27:48,437 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:27:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:27:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:27:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:27:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-06 23:27:48,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-06 23:27:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:48,481 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-06 23:27:48,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:27:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-06 23:27:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:27:48,483 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:48,483 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:48,483 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1022759404, now seen corresponding path program 1 times [2019-10-06 23:27:48,486 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:48,486 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:48,486 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:48,487 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:27:48,591 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:48,591 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:27:48,592 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:27:48,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:27:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:27:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:27:48,596 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2019-10-06 23:27:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:48,661 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-06 23:27:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:27:48,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-06 23:27:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:48,663 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:27:48,663 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:27:48,665 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:27:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:27:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-06 23:27:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:27:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:27:48,677 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2019-10-06 23:27:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:48,678 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:27:48,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:27:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:27:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:27:48,679 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:48,680 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:48,680 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1659797787, now seen corresponding path program 1 times [2019-10-06 23:27:48,681 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:48,682 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:48,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:48,682 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:27:48,823 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:48,823 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:48,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:27:48,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:27:48,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:27:48,986 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:49,020 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:27:49,021 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:49,030 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:49,039 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:49,040 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:49,193 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:49,558 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-06 23:27:49,580 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:49,593 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:49,593 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:49,594 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 98#(and (or (and (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1)) (and (not (= main_~r~0 0)) (= main_~i~0 2) (= main_~j~0 0) (not (<= 0 main_~j~0)))) (and (<= 1 main_~i~0) (<= main_~i~0 1))) [2019-10-06 23:27:49,594 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 161#false [2019-10-06 23:27:49,594 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 152#false [2019-10-06 23:27:49,595 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 166#false [2019-10-06 23:27:49,596 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 175#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:49,596 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 147#false [2019-10-06 23:27:49,596 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 93#(and (not (= main_~r~0 0)) (<= 0 main_~j~0) (= (+ main_~i~0 (- 1)) main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (<= main_~j~0 0)) [2019-10-06 23:27:49,597 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:49,597 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:49,597 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 137#false [2019-10-06 23:27:49,598 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 180#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:49,598 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 171#false [2019-10-06 23:27:49,599 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:49,599 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:27:49,599 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 156#false [2019-10-06 23:27:49,600 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 106#(and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~r~0 0) (<= 0 main_~r~0)) [2019-10-06 23:27:49,835 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:27:49,835 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 4, 4] total 16 [2019-10-06 23:27:49,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-06 23:27:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-06 23:27:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-10-06 23:27:49,838 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2019-10-06 23:27:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:50,048 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-10-06 23:27:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-06 23:27:50,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-10-06 23:27:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:50,049 INFO L225 Difference]: With dead ends: 36 [2019-10-06 23:27:50,050 INFO L226 Difference]: Without dead ends: 23 [2019-10-06 23:27:50,052 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:27:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-06 23:27:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-06 23:27:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:27:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-06 23:27:50,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2019-10-06 23:27:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:50,060 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-06 23:27:50,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-06 23:27:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-06 23:27:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:27:50,061 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:50,062 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:50,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:50,263 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1224522591, now seen corresponding path program 1 times [2019-10-06 23:27:50,264 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:50,264 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:50,264 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:50,264 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:27:50,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:50,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:50,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:27:50,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:27:50,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:27:50,430 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:50,433 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:27:50,434 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:50,434 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:50,435 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:50,435 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:50,478 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:50,878 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:27:50,888 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:50,892 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:50,892 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:50,893 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 199#(<= 1 main_~i~0) [2019-10-06 23:27:50,893 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 295#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:27:50,893 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 286#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:27:50,893 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 300#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:27:50,894 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:50,894 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 281#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:27:50,894 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 191#(<= 1 main_~i~0) [2019-10-06 23:27:50,894 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:50,895 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:50,895 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 271#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:27:50,895 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:50,895 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:27:50,896 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:50,896 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:27:50,896 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 290#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) [2019-10-06 23:27:50,896 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 208#(<= 1 main_~i~0) [2019-10-06 23:27:54,977 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:27:55,339 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:55,340 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 12] total 21 [2019-10-06 23:27:55,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-06 23:27:55,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-06 23:27:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-10-06 23:27:55,343 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 21 states. [2019-10-06 23:27:57,924 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-06 23:27:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:58,070 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2019-10-06 23:27:58,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-06 23:27:58,070 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2019-10-06 23:27:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:58,073 INFO L225 Difference]: With dead ends: 70 [2019-10-06 23:27:58,074 INFO L226 Difference]: Without dead ends: 48 [2019-10-06 23:27:58,075 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=372, Invalid=1980, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:27:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-06 23:27:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2019-10-06 23:27:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-06 23:27:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-10-06 23:27:58,096 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2019-10-06 23:27:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:58,099 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-10-06 23:27:58,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-06 23:27:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-10-06 23:27:58,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-06 23:27:58,100 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:58,101 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:58,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:58,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:58,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1005552771, now seen corresponding path program 2 times [2019-10-06 23:27:58,313 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:58,313 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:58,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:58,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:27:58,457 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:58,457 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:58,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:58,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:27:58,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:27:58,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:27:58,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-06 23:27:58,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-06 23:27:58,680 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:58,681 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:27:58,682 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:58,682 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:58,683 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:58,683 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:58,728 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:58,990 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:27:58,998 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:59,006 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:59,006 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:59,007 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 202#(<= 1 main_~i~0) [2019-10-06 23:27:59,007 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 298#(and (exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:27:59,007 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 289#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:27:59,008 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 303#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:27:59,008 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 312#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:59,008 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 284#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:27:59,008 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 194#(<= 1 main_~i~0) [2019-10-06 23:27:59,008 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:59,009 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:59,009 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 274#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:27:59,009 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 317#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:27:59,010 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:27:59,010 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:59,011 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:27:59,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 293#(exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) [2019-10-06 23:27:59,011 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 211#(<= 1 main_~i~0) [2019-10-06 23:28:03,052 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:28:03,386 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:03,386 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 12] total 28 [2019-10-06 23:28:03,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:28:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:28:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:28:03,389 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 28 states. [2019-10-06 23:28:07,857 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-06 23:28:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:08,006 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2019-10-06 23:28:08,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-06 23:28:08,007 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-10-06 23:28:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:08,010 INFO L225 Difference]: With dead ends: 136 [2019-10-06 23:28:08,010 INFO L226 Difference]: Without dead ends: 104 [2019-10-06 23:28:08,015 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1852, Invalid=8248, Unknown=0, NotChecked=0, Total=10100 [2019-10-06 23:28:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-06 23:28:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2019-10-06 23:28:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-06 23:28:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2019-10-06 23:28:08,032 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 29 [2019-10-06 23:28:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:08,032 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-10-06 23:28:08,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:28:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2019-10-06 23:28:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-06 23:28:08,035 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:08,035 INFO L385 BasicCegarLoop]: trace histogram [23, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:08,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:08,239 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:08,240 INFO L82 PathProgramCache]: Analyzing trace with hash -534110383, now seen corresponding path program 3 times [2019-10-06 23:28:08,240 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:08,240 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:08,240 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:08,241 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 167 proven. 349 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-06 23:28:08,723 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:08,723 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:08,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:08,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:28:08,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:28:08,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:28:08,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:09,134 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-06 23:28:09,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-06 23:28:09,444 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:09,446 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:28:09,446 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:09,447 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:09,447 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:09,447 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:09,473 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:09,681 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:28:09,688 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:09,692 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:09,692 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:09,693 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 199#(<= 1 main_~i~0) [2019-10-06 23:28:09,693 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 295#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:09,693 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 286#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:28:09,693 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 300#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:09,694 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:09,694 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 281#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:28:09,695 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 191#(<= 1 main_~i~0) [2019-10-06 23:28:09,699 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:28:09,699 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:28:09,699 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 271#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:28:09,700 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:28:09,700 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:28:09,700 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:09,700 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:28:09,701 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 290#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) [2019-10-06 23:28:09,701 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 208#(<= 1 main_~i~0) [2019-10-06 23:28:13,802 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:28:14,270 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:14,270 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13, 13, 12] total 56 [2019-10-06 23:28:14,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-06 23:28:14,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-06 23:28:14,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2713, Unknown=0, NotChecked=0, Total=3080 [2019-10-06 23:28:14,274 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand 56 states. [2019-10-06 23:28:52,692 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-10-06 23:29:02,783 WARN L191 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-06 23:29:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:29:03,614 INFO L93 Difference]: Finished difference Result 3387 states and 5308 transitions. [2019-10-06 23:29:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 753 states. [2019-10-06 23:29:03,615 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 65 [2019-10-06 23:29:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:29:03,636 INFO L225 Difference]: With dead ends: 3387 [2019-10-06 23:29:03,636 INFO L226 Difference]: Without dead ends: 2835 [2019-10-06 23:29:03,674 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 802 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319499 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=74800, Invalid=570812, Unknown=0, NotChecked=0, Total=645612 [2019-10-06 23:29:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-10-06 23:29:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 504. [2019-10-06 23:29:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-06 23:29:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2019-10-06 23:29:03,809 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 65 [2019-10-06 23:29:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:29:03,810 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2019-10-06 23:29:03,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-06 23:29:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2019-10-06 23:29:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-06 23:29:03,817 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:29:03,817 INFO L385 BasicCegarLoop]: trace histogram [46, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:29:04,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:29:04,022 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:29:04,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:29:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash -550424178, now seen corresponding path program 4 times [2019-10-06 23:29:04,023 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:29:04,023 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:29:04,023 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:29:04,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:29:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:29:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:29:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1439 proven. 856 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-10-06 23:29:04,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:29:04,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:29:04,750 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:29:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:29:04,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-06 23:29:04,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:29:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-06 23:29:05,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:29:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-06 23:29:06,571 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:29:06,572 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:29:06,573 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:29:06,573 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:29:06,573 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:29:06,574 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:29:06,600 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:29:06,766 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:29:06,772 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:29:06,780 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:29:06,780 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:29:06,780 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 202#(<= 1 main_~i~0) [2019-10-06 23:29:06,780 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 298#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 0))))) [2019-10-06 23:29:06,781 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 289#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:29:06,781 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 303#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 0))))) [2019-10-06 23:29:06,781 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 312#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:29:06,781 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 284#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:29:06,781 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 194#(<= 1 main_~i~0) [2019-10-06 23:29:06,782 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:29:06,782 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:29:06,782 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 274#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:29:06,782 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 317#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:29:06,783 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 0))))) [2019-10-06 23:29:06,783 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:29:06,783 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:29:06,783 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 293#(exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 4)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|)) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:29:06,783 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 211#(<= 1 main_~i~0) [2019-10-06 23:29:10,886 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:29:11,458 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:29:11,459 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 23, 23, 12] total 90 [2019-10-06 23:29:11,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-10-06 23:29:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-10-06 23:29:11,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1255, Invalid=6755, Unknown=0, NotChecked=0, Total=8010 [2019-10-06 23:29:11,462 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand 90 states. [2019-10-06 23:29:28,456 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-10-06 23:31:17,902 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-10-06 23:31:33,145 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-10-06 23:33:21,590 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-06 23:33:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:27,686 INFO L93 Difference]: Finished difference Result 57965 states and 75346 transitions. [2019-10-06 23:33:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1293 states. [2019-10-06 23:33:27,687 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 120 [2019-10-06 23:33:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:27,863 INFO L225 Difference]: With dead ends: 57965 [2019-10-06 23:33:27,863 INFO L226 Difference]: Without dead ends: 56790 [2019-10-06 23:33:28,040 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1687 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 1376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965121 ImplicationChecksByTransitivity, 232.3s TimeCoverageRelationStatistics Valid=330183, Invalid=1567323, Unknown=0, NotChecked=0, Total=1897506 [2019-10-06 23:33:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56790 states. [2019-10-06 23:33:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56790 to 3673. [2019-10-06 23:33:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-10-06 23:33:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4861 transitions. [2019-10-06 23:33:32,321 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4861 transitions. Word has length 120 [2019-10-06 23:33:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:32,321 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4861 transitions. [2019-10-06 23:33:32,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-10-06 23:33:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4861 transitions. [2019-10-06 23:33:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-06 23:33:32,334 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:32,334 INFO L385 BasicCegarLoop]: trace histogram [111, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:32,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:32,539 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1876959479, now seen corresponding path program 5 times [2019-10-06 23:33:32,540 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:32,540 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:32,540 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:32,540 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13240 backedges. 9908 proven. 2241 refuted. 0 times theorem prover too weak. 1091 trivial. 0 not checked. [2019-10-06 23:33:34,010 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:34,010 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:34,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:34,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:33:34,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:34,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-06 23:33:34,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 13240 backedges. 776 proven. 10 refuted. 0 times theorem prover too weak. 12454 trivial. 0 not checked. [2019-10-06 23:33:34,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13240 backedges. 776 proven. 10 refuted. 0 times theorem prover too weak. 12454 trivial. 0 not checked. [2019-10-06 23:33:34,813 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:34,814 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:33:34,815 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:34,815 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:34,815 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:34,815 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:34,834 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:34,958 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:33:34,965 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:34,967 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:34,967 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:34,967 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 205#(<= 1 main_~i~0) [2019-10-06 23:33:34,968 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 301#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_10) (+ v_prenex_9 4)) (select (select |#memory_int| v_prenex_10) v_prenex_9)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:34,968 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 292#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:34,968 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 306#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_10) (+ v_prenex_9 4)) (select (select |#memory_int| v_prenex_10) v_prenex_9)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:34,968 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 315#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:34,969 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 287#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:33:34,969 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 197#(<= 1 main_~i~0) [2019-10-06 23:33:34,969 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:34,969 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:34,969 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 277#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:33:34,969 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 320#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:34,970 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 311#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_10) (+ v_prenex_9 4)) (select (select |#memory_int| v_prenex_10) v_prenex_9)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:34,970 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:34,970 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:33:34,970 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 296#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| v_prenex_10) (+ v_prenex_9 4)) (select (select |#memory_int| v_prenex_10) v_prenex_9)))))) [2019-10-06 23:33:34,970 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 214#(<= 1 main_~i~0) [2019-10-06 23:33:39,067 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:33:39,668 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:39,668 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 9, 9, 12] total 82 [2019-10-06 23:33:39,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-06 23:33:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-06 23:33:39,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1142, Invalid=5500, Unknown=0, NotChecked=0, Total=6642 [2019-10-06 23:33:39,672 INFO L87 Difference]: Start difference. First operand 3673 states and 4861 transitions. Second operand 82 states. [2019-10-06 23:33:44,204 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-06 23:33:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:44,423 INFO L93 Difference]: Finished difference Result 4207 states and 5605 transitions. [2019-10-06 23:33:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-06 23:33:44,423 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 249 [2019-10-06 23:33:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:44,427 INFO L225 Difference]: With dead ends: 4207 [2019-10-06 23:33:44,427 INFO L226 Difference]: Without dead ends: 601 [2019-10-06 23:33:44,436 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4623 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2083, Invalid=13417, Unknown=0, NotChecked=0, Total=15500 [2019-10-06 23:33:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-06 23:33:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 373. [2019-10-06 23:33:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-06 23:33:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 418 transitions. [2019-10-06 23:33:44,646 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 418 transitions. Word has length 249 [2019-10-06 23:33:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:44,647 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 418 transitions. [2019-10-06 23:33:44,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-06 23:33:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 418 transitions. [2019-10-06 23:33:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-10-06 23:33:44,652 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:44,653 INFO L385 BasicCegarLoop]: trace histogram [229, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:44,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:44,857 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:44,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:44,858 INFO L82 PathProgramCache]: Analyzing trace with hash 973440863, now seen corresponding path program 6 times [2019-10-06 23:33:44,858 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:44,858 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:44,858 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:44,859 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:44,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 38079 backedges. 28544 proven. 7948 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2019-10-06 23:33:47,529 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:47,529 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:47,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:48,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:33:48,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:48,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1746 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-06 23:33:48,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 38079 backedges. 0 proven. 36384 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2019-10-06 23:33:50,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 38079 backedges. 0 proven. 36384 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2019-10-06 23:33:54,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:54,162 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:33:54,162 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:54,162 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:54,163 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:54,163 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:54,196 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:54,351 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:33:54,357 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:54,360 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:54,360 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:54,360 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 199#(<= 1 main_~i~0) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 295#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 286#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 300#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 281#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 191#(<= 1 main_~i~0) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:54,361 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:54,362 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 271#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:33:54,362 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:54,362 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:54,362 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:54,363 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:33:54,363 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 290#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 4)))))) [2019-10-06 23:33:54,363 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 208#(<= 1 main_~i~0) [2019-10-06 23:33:58,491 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:33:59,347 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:59,347 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 45, 45, 12] total 171 [2019-10-06 23:33:59,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 171 states [2019-10-06 23:33:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2019-10-06 23:33:59,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4886, Invalid=24184, Unknown=0, NotChecked=0, Total=29070 [2019-10-06 23:33:59,352 INFO L87 Difference]: Start difference. First operand 373 states and 418 transitions. Second operand 171 states. [2019-10-06 23:37:07,566 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-06 23:37:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:37:16,543 INFO L93 Difference]: Finished difference Result 2564 states and 3295 transitions. [2019-10-06 23:37:16,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1205 states. [2019-10-06 23:37:16,544 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 367 [2019-10-06 23:37:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:37:16,550 INFO L225 Difference]: With dead ends: 2564 [2019-10-06 23:37:16,550 INFO L226 Difference]: Without dead ends: 2107 [2019-10-06 23:37:16,639 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2378 GetRequests, 1009 SyntacticMatches, 0 SemanticMatches, 1369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884682 ImplicationChecksByTransitivity, 197.8s TimeCoverageRelationStatistics Valid=347932, Invalid=1530338, Unknown=0, NotChecked=0, Total=1878270 [2019-10-06 23:37:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2019-10-06 23:37:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1688. [2019-10-06 23:37:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2019-10-06 23:37:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 1892 transitions. [2019-10-06 23:37:17,308 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 1892 transitions. Word has length 367 [2019-10-06 23:37:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:37:17,309 INFO L462 AbstractCegarLoop]: Abstraction has 1688 states and 1892 transitions. [2019-10-06 23:37:17,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 171 states. [2019-10-06 23:37:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 1892 transitions. [2019-10-06 23:37:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2019-10-06 23:37:17,333 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:37:17,333 INFO L385 BasicCegarLoop]: trace histogram [490, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:37:17,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:17,542 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:37:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:37:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -74674586, now seen corresponding path program 7 times [2019-10-06 23:37:17,543 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:37:17,543 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:17,544 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:17,544 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:37:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 171591 backedges. 148380 proven. 18044 refuted. 0 times theorem prover too weak. 5167 trivial. 0 not checked. [2019-10-06 23:37:24,091 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:24,092 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:24,092 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:25,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 3604 conjuncts, 86 conjunts are in the unsatisfiable core [2019-10-06 23:37:25,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:37:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 171591 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 168021 trivial. 0 not checked. [2019-10-06 23:37:32,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:37:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 171591 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 168021 trivial. 0 not checked. [2019-10-06 23:37:45,291 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:37:45,293 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:37:45,293 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:37:45,294 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:37:45,294 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:37:45,294 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:37:45,324 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:37:45,463 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:37:45,469 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:37:45,471 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:37:45,472 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:37:45,472 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 202#(<= 1 main_~i~0) [2019-10-06 23:37:45,472 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 298#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_13) v_prenex_14) (select (select |#memory_int| v_prenex_13) (+ v_prenex_14 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:37:45,472 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 289#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:37:45,472 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 303#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_13) v_prenex_14) (select (select |#memory_int| v_prenex_13) (+ v_prenex_14 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:37:45,472 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 284#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:37:45,472 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 312#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:37:45,473 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 194#(<= 1 main_~i~0) [2019-10-06 23:37:45,473 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 274#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-06 23:37:45,473 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:37:45,473 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:37:45,473 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 317#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:37:45,474 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 308#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_13) v_prenex_14) (select (select |#memory_int| v_prenex_13) (+ v_prenex_14 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:37:45,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:37:45,474 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-06 23:37:45,474 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 293#(exists ((|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_13) v_prenex_14) (select (select |#memory_int| v_prenex_13) (+ v_prenex_14 4)))))) [2019-10-06 23:37:45,474 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 211#(<= 1 main_~i~0) [2019-10-06 23:37:49,657 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-06 23:37:50,988 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:37:50,989 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 87, 87, 12] total 301 [2019-10-06 23:37:50,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 301 states [2019-10-06 23:37:50,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 301 interpolants. [2019-10-06 23:37:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18824, Invalid=71476, Unknown=0, NotChecked=0, Total=90300 [2019-10-06 23:37:51,000 INFO L87 Difference]: Start difference. First operand 1688 states and 1892 transitions. Second operand 301 states.