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/loop-acceleration/array_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:57:22,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:57:22,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:57:22,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:57:22,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:57:22,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:57:22,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:57:22,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:57:22,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:57:22,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:57:22,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:57:22,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:57:22,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:57:22,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:57:22,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:57:22,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:57:22,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:57:22,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:57:22,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:57:22,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:57:22,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:57:22,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:57:22,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:57:22,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:57:22,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:57:22,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:57:22,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:57:22,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:57:22,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:57:22,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:57:22,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:57:22,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:57:22,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:57:22,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:57:22,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:57:22,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:57:22,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:57:22,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:57:22,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:57:22,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:57:22,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:57:22,655 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-13 22:57:22,689 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:57:22,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:57:22,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:57:22,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:57:22,691 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:57:22,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:57:22,692 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:57:22,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:57:22,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:57:22,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:57:22,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:57:22,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:57:22,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:57:22,693 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:57:22,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:57:22,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:57:22,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:57:22,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:57:22,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:57:22,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:57:22,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:57:22,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:22,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:57:22,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:57:22,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:57:22,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:57:22,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:57:22,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:57:22,696 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-13 22:57:22,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:57:22,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:57:22,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:57:22,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:57:22,980 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:57:22,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_4.i [2019-10-13 22:57:23,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaeebfe2f/615933c15bc64b708813172c470decd4/FLAG73117b4ad [2019-10-13 22:57:23,530 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:57:23,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_4.i [2019-10-13 22:57:23,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaeebfe2f/615933c15bc64b708813172c470decd4/FLAG73117b4ad [2019-10-13 22:57:23,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaeebfe2f/615933c15bc64b708813172c470decd4 [2019-10-13 22:57:23,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:57:23,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:57:23,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:23,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:57:23,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:57:23,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:23" (1/1) ... [2019-10-13 22:57:23,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a0160e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:23, skipping insertion in model container [2019-10-13 22:57:23,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:23" (1/1) ... [2019-10-13 22:57:23,984 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:57:24,000 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:57:24,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:24,179 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:57:24,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:24,220 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:57:24,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24 WrapperNode [2019-10-13 22:57:24,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:24,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:57:24,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:57:24,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:57:24,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (1/1) ... [2019-10-13 22:57:24,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (1/1) ... [2019-10-13 22:57:24,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (1/1) ... [2019-10-13 22:57:24,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (1/1) ... [2019-10-13 22:57:24,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (1/1) ... [2019-10-13 22:57:24,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (1/1) ... [2019-10-13 22:57:24,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (1/1) ... [2019-10-13 22:57:24,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:57:24,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:57:24,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:57:24,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:57:24,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (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-13 22:57:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:57:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:57:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:57:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:57:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:57:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:57:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:57:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:57:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:57:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:57:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:57:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:57:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:57:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:57:24,654 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:57:24,654 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 22:57:24,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:24 BoogieIcfgContainer [2019-10-13 22:57:24,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:57:24,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:57:24,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:57:24,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:57:24,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:57:23" (1/3) ... [2019-10-13 22:57:24,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4002db03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:24, skipping insertion in model container [2019-10-13 22:57:24,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:24" (2/3) ... [2019-10-13 22:57:24,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4002db03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:24, skipping insertion in model container [2019-10-13 22:57:24,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:24" (3/3) ... [2019-10-13 22:57:24,664 INFO L109 eAbstractionObserver]: Analyzing ICFG array_4.i [2019-10-13 22:57:24,677 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:57:24,686 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:57:24,699 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:57:24,726 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:57:24,727 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:57:24,727 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:57:24,727 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:57:24,727 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:57:24,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:57:24,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:57:24,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:57:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 22:57:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:57:24,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:24,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:24,757 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2005487052, now seen corresponding path program 1 times [2019-10-13 22:57:24,772 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:24,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551545263] [2019-10-13 22:57:24,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:24,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:24,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:24,889 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-13 22:57:24,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551545263] [2019-10-13 22:57:24,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:24,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 22:57:24,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505207910] [2019-10-13 22:57:24,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 22:57:24,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:24,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 22:57:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:57:24,914 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-10-13 22:57:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:24,936 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-13 22:57:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 22:57:24,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-10-13 22:57:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:24,944 INFO L225 Difference]: With dead ends: 30 [2019-10-13 22:57:24,944 INFO L226 Difference]: Without dead ends: 13 [2019-10-13 22:57:24,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:57:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-13 22:57:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-13 22:57:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-13 22:57:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-13 22:57:24,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-10-13 22:57:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:24,987 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-13 22:57:24,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 22:57:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-13 22:57:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:57:24,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:24,989 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:24,989 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:24,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1973180885, now seen corresponding path program 1 times [2019-10-13 22:57:24,990 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:24,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713669862] [2019-10-13 22:57:24,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:24,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:24,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:25,108 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-13 22:57:25,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713669862] [2019-10-13 22:57:25,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:25,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:25,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004175452] [2019-10-13 22:57:25,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:25,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:25,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:25,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:25,113 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-10-13 22:57:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:25,166 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-10-13 22:57:25,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:25,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 22:57:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:25,170 INFO L225 Difference]: With dead ends: 24 [2019-10-13 22:57:25,171 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 22:57:25,172 INFO L600 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-13 22:57:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 22:57:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-10-13 22:57:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 22:57:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-13 22:57:25,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-10-13 22:57:25,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:25,183 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-13 22:57:25,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-13 22:57:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:57:25,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:25,186 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:25,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:25,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:25,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1604112681, now seen corresponding path program 1 times [2019-10-13 22:57:25,188 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:25,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915784962] [2019-10-13 22:57:25,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:25,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:25,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:25,330 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-13 22:57:25,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915784962] [2019-10-13 22:57:25,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:25,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:57:25,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724334966] [2019-10-13 22:57:25,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:57:25,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:25,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:57:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:57:25,335 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-10-13 22:57:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:25,390 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-13 22:57:25,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:57:25,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-13 22:57:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:25,392 INFO L225 Difference]: With dead ends: 21 [2019-10-13 22:57:25,392 INFO L226 Difference]: Without dead ends: 16 [2019-10-13 22:57:25,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:57:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-13 22:57:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-13 22:57:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 22:57:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-13 22:57:25,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-10-13 22:57:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:25,398 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-13 22:57:25,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:57:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-13 22:57:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:57:25,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:25,400 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:25,400 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:25,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1243733017, now seen corresponding path program 1 times [2019-10-13 22:57:25,401 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:25,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166120790] [2019-10-13 22:57:25,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:25,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:25,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:57:25,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166120790] [2019-10-13 22:57:25,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312766142] [2019-10-13 22:57:25,467 INFO L94 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-13 22:57:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:25,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 22:57:25,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:25,555 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-13 22:57:25,556 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:25,612 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-13 22:57:25,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [600943742] [2019-10-13 22:57:25,644 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 22:57:25,644 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:25,653 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:25,662 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:25,663 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:25,848 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:26,143 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 22:57:26,170 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:26,179 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:26,179 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:26,179 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 22:57:26,180 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:26,180 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) 0)) [2019-10-13 22:57:26,180 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-13 22:57:26,181 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-13 22:57:26,181 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-13 22:57:26,181 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 22:57:26,181 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:26,182 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(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_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:26,182 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) |main_#t~mem3|) (<= 0 main_~i~0)) [2019-10-13 22:57:26,183 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:26,184 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 22:57:26,185 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(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_1| Int) (v_main_~i~0_BEFORE_CALL_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_1 1024) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= v_main_~i~0_BEFORE_CALL_1 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_1) (= 0 (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ (* v_main_~i~0_BEFORE_CALL_1 4) |v_main_~#A~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:26,503 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:26,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 11] total 19 [2019-10-13 22:57:26,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31798497] [2019-10-13 22:57:26,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 22:57:26,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:26,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 22:57:26,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-10-13 22:57:26,508 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 19 states. [2019-10-13 22:57:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:27,568 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-10-13 22:57:27,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 22:57:27,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-10-13 22:57:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:27,570 INFO L225 Difference]: With dead ends: 39 [2019-10-13 22:57:27,570 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 22:57:27,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=1224, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 22:57:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 22:57:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 22:57:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 22:57:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-13 22:57:27,578 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-10-13 22:57:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:27,579 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-13 22:57:27,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 22:57:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-13 22:57:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 22:57:27,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:27,580 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:27,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:27,793 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash 280735325, now seen corresponding path program 2 times [2019-10-13 22:57:27,794 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:27,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402830895] [2019-10-13 22:57:27,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:27,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:27,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 22:57:27,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402830895] [2019-10-13 22:57:27,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613474931] [2019-10-13 22:57:27,904 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 22:57:27,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 22:57:27,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:27,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 22:57:27,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 22:57:27,997 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 22:57:28,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [880709323] [2019-10-13 22:57:28,075 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 22:57:28,075 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:28,075 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:28,076 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:28,076 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:28,128 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:28,311 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 22:57:28,331 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:28,338 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:28,338 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:28,339 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 22:57:28,339 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:28,339 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) 0)) [2019-10-13 22:57:28,339 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-13 22:57:28,340 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-13 22:57:28,340 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-13 22:57:28,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 22:57:28,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:28,341 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(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_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0))))) [2019-10-13 22:57:28,341 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) |main_#t~mem3|) (<= 0 main_~i~0)) [2019-10-13 22:57:28,349 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0))))) [2019-10-13 22:57:28,350 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0)))) [2019-10-13 22:57:28,350 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(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_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_BEFORE_CALL_2 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~i~0_BEFORE_CALL_2) (not (<= v_main_~i~0_BEFORE_CALL_2 1024)) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~i~0_BEFORE_CALL_2) (<= v_main_~i~0_BEFORE_CALL_2 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| (* v_main_~i~0_BEFORE_CALL_2 4))) 0))))) [2019-10-13 22:57:28,632 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:28,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 25 [2019-10-13 22:57:28,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532590295] [2019-10-13 22:57:28,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 22:57:28,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:28,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 22:57:28,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-10-13 22:57:28,636 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 25 states. [2019-10-13 22:57:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:30,290 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2019-10-13 22:57:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-13 22:57:30,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-10-13 22:57:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:30,292 INFO L225 Difference]: With dead ends: 66 [2019-10-13 22:57:30,293 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 22:57:30,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=663, Invalid=2877, Unknown=0, NotChecked=0, Total=3540 [2019-10-13 22:57:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 22:57:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-13 22:57:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 22:57:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-10-13 22:57:30,303 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 24 [2019-10-13 22:57:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:30,304 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-10-13 22:57:30,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 22:57:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-10-13 22:57:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 22:57:30,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:30,305 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:30,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:30,507 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:30,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1071163863, now seen corresponding path program 3 times [2019-10-13 22:57:30,508 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:30,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144637234] [2019-10-13 22:57:30,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:30,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 22:57:30,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144637234] [2019-10-13 22:57:30,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53878948] [2019-10-13 22:57:30,725 INFO L92 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 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-13 22:57:30,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:57:30,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:30,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 22:57:30,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-13 22:57:30,865 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-13 22:57:31,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1107048522] [2019-10-13 22:57:31,143 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 22:57:31,143 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:31,144 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:31,144 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:31,145 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:31,175 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:31,268 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 22:57:31,277 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:31,281 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:31,282 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:31,282 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 22:57:31,282 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:31,282 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) 0)) [2019-10-13 22:57:31,282 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-13 22:57:31,283 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-13 22:57:31,283 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-13 22:57:31,283 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 22:57:31,283 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:31,284 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) (<= 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-13 22:57:31,284 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) |main_#t~mem3|) (<= 0 main_~i~0)) [2019-10-13 22:57:31,284 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:31,284 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) [2019-10-13 22:57:31,285 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int) (v_main_~i~0_BEFORE_CALL_3 Int)) (or (and (<= v_main_~i~0_BEFORE_CALL_3 1024) (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_3)) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| (* v_main_~i~0_BEFORE_CALL_3 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_3 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_3)))) (<= 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-13 22:57:31,612 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:31,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13, 11] total 37 [2019-10-13 22:57:31,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862250612] [2019-10-13 22:57:31,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-13 22:57:31,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-13 22:57:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=999, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 22:57:31,616 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 37 states. [2019-10-13 22:57:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:34,802 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2019-10-13 22:57:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-13 22:57:34,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 42 [2019-10-13 22:57:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:34,804 INFO L225 Difference]: With dead ends: 120 [2019-10-13 22:57:34,804 INFO L226 Difference]: Without dead ends: 79 [2019-10-13 22:57:34,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2861 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2202, Invalid=8100, Unknown=0, NotChecked=0, Total=10302 [2019-10-13 22:57:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-13 22:57:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-13 22:57:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-13 22:57:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-10-13 22:57:34,822 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 42 [2019-10-13 22:57:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:34,822 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-10-13 22:57:34,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-13 22:57:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-10-13 22:57:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 22:57:34,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:34,825 INFO L380 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:35,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:35,030 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2103025601, now seen corresponding path program 4 times [2019-10-13 22:57:35,031 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:35,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721082756] [2019-10-13 22:57:35,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:35,033 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:35,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 22:57:35,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721082756] [2019-10-13 22:57:35,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076239993] [2019-10-13 22:57:35,560 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-13 22:57:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:35,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 22:57:35,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-13 22:57:35,703 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-13 22:57:36,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1151869987] [2019-10-13 22:57:36,698 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 22:57:36,699 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:36,699 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:36,699 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:36,699 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:36,727 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:36,832 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 22:57:36,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:36,845 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:36,845 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:36,846 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 68#true [2019-10-13 22:57:36,846 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 143#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:36,846 INFO L193 IcfgInterpreter]: Reachable states at location L19-5 satisfy 119#(and (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) 0)) [2019-10-13 22:57:36,846 INFO L193 IcfgInterpreter]: Reachable states at location L19-4 satisfy 109#(<= 0 main_~i~0) [2019-10-13 22:57:36,847 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-13 22:57:36,847 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-13 22:57:36,847 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 148#(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-13 22:57:36,847 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:36,848 INFO L193 IcfgInterpreter]: Reachable states at location L6 satisfy 134#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_4 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) (<= 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-13 22:57:36,848 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 114#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~i~0 4) |main_~#A~0.offset|)) |main_#t~mem3|) (<= 0 main_~i~0)) [2019-10-13 22:57:36,848 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 129#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_4 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:36,848 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 124#(exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_4 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) [2019-10-13 22:57:36,849 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 139#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_main_~i~0_BEFORE_CALL_4 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (not (<= v_main_~i~0_BEFORE_CALL_4 1024)) (<= 0 v_main_~i~0_BEFORE_CALL_4)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= v_main_~i~0_BEFORE_CALL_4 1024) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| (* v_main_~i~0_BEFORE_CALL_4 4))) 0) (<= 0 v_main_~i~0_BEFORE_CALL_4)))) (<= 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-13 22:57:37,370 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:37,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25, 11] total 61 [2019-10-13 22:57:37,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053031827] [2019-10-13 22:57:37,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 22:57:37,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:37,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 22:57:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1209, Invalid=2451, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 22:57:37,376 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2019-10-13 22:57:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:46,584 INFO L93 Difference]: Finished difference Result 228 states and 277 transitions. [2019-10-13 22:57:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-13 22:57:46,584 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2019-10-13 22:57:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:46,590 INFO L225 Difference]: With dead ends: 228 [2019-10-13 22:57:46,590 INFO L226 Difference]: Without dead ends: 151 [2019-10-13 22:57:46,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9773 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=8195, Invalid=26214, Unknown=1, NotChecked=0, Total=34410 [2019-10-13 22:57:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-13 22:57:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-10-13 22:57:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-13 22:57:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-10-13 22:57:46,629 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 78 [2019-10-13 22:57:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:46,629 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-10-13 22:57:46,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 22:57:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-10-13 22:57:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 22:57:46,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:46,632 INFO L380 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:46,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:46,844 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:46,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2140019441, now seen corresponding path program 5 times [2019-10-13 22:57:46,846 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:46,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456925516] [2019-10-13 22:57:46,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:46,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:46,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 22:57:48,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456925516] [2019-10-13 22:57:48,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760015090] [2019-10-13 22:57:48,502 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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