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/reducercommutativity/sum05-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:20:54,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:20:54,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:20:54,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:20:54,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:20:54,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:20:54,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:20:54,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:20:54,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:20:54,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:20:54,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:20:54,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:20:54,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:20:54,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:20:54,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:20:54,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:20:54,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:20:54,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:20:54,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:20:54,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:20:54,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:20:54,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:20:54,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:20:54,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:20:54,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:20:54,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:20:54,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:20:54,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:20:54,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:20:54,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:20:54,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:20:54,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:20:54,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:20:54,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:20:54,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:20:54,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:20:54,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:20:54,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:20:54,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:20:54,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:20:54,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:20:54,700 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 23:20:54,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:20:54,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:20:54,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:20:54,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:20:54,727 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:20:54,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:20:54,728 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:20:54,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:20:54,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:20:54,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:20:54,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:20:54,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:20:54,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:20:54,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:20:54,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:20:54,730 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:20:54,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:20:54,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:20:54,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:20:54,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:20:54,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:20:54,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:20:54,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:20:54,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:20:54,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:20:54,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:20:54,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:20:54,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:20:54,732 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 23:20:54,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:20:55,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:20:55,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:20:55,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:20:55,011 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:20:55,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum05-2.i [2019-10-13 23:20:55,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7446ed235/6949a360de334880a42029fe38d6dea9/FLAGba0ed7834 [2019-10-13 23:20:55,544 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:20:55,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum05-2.i [2019-10-13 23:20:55,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7446ed235/6949a360de334880a42029fe38d6dea9/FLAGba0ed7834 [2019-10-13 23:20:55,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7446ed235/6949a360de334880a42029fe38d6dea9 [2019-10-13 23:20:55,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:20:55,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:20:55,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:55,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:20:55,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:20:55,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:55" (1/1) ... [2019-10-13 23:20:55,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fef2b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:55, skipping insertion in model container [2019-10-13 23:20:55,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:55" (1/1) ... [2019-10-13 23:20:55,978 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:20:55,996 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:20:56,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:56,190 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:20:56,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:56,300 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:20:56,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56 WrapperNode [2019-10-13 23:20:56,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:56,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:20:56,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:20:56,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:20:56,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (1/1) ... [2019-10-13 23:20:56,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (1/1) ... [2019-10-13 23:20:56,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (1/1) ... [2019-10-13 23:20:56,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (1/1) ... [2019-10-13 23:20:56,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (1/1) ... [2019-10-13 23:20:56,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (1/1) ... [2019-10-13 23:20:56,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (1/1) ... [2019-10-13 23:20:56,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:20:56,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:20:56,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:20:56,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:20:56,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (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 23:20:56,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:20:56,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:20:56,398 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-13 23:20:56,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:20:56,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:20:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:20:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-13 23:20:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 23:20:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:20:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 23:20:56,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 23:20:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 23:20:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:20:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:20:56,729 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:20:56,730 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 23:20:56,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:56 BoogieIcfgContainer [2019-10-13 23:20:56,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:20:56,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:20:56,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:20:56,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:20:56,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:20:55" (1/3) ... [2019-10-13 23:20:56,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7648165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:56, skipping insertion in model container [2019-10-13 23:20:56,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:56" (2/3) ... [2019-10-13 23:20:56,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7648165d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:56, skipping insertion in model container [2019-10-13 23:20:56,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:56" (3/3) ... [2019-10-13 23:20:56,738 INFO L109 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2019-10-13 23:20:56,748 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:20:56,755 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:20:56,766 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:20:56,790 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:20:56,790 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:20:56,790 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:20:56,790 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:20:56,791 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:20:56,791 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:20:56,791 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:20:56,791 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:20:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 23:20:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 23:20:56,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:56,814 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:56,816 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:56,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1818423299, now seen corresponding path program 1 times [2019-10-13 23:20:56,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:56,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169327801] [2019-10-13 23:20:56,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:56,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:56,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:20:57,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169327801] [2019-10-13 23:20:57,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:57,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:57,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203543382] [2019-10-13 23:20:57,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:57,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:57,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:57,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:57,057 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 23:20:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:57,107 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-13 23:20:57,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:57,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 23:20:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:57,123 INFO L225 Difference]: With dead ends: 41 [2019-10-13 23:20:57,123 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 23:20:57,126 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 23:20:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 23:20:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 23:20:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 23:20:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 23:20:57,165 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-13 23:20:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:57,166 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 23:20:57,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 23:20:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 23:20:57,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:57,168 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:57,169 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2093950433, now seen corresponding path program 1 times [2019-10-13 23:20:57,170 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:57,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874759742] [2019-10-13 23:20:57,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:57,171 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:57,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:57,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874759742] [2019-10-13 23:20:57,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623566843] [2019-10-13 23:20:57,250 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 23:20:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:57,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:20:57,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:57,361 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:57,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:20:57,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-13 23:20:57,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828419225] [2019-10-13 23:20:57,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:57,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:20:57,415 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 23:20:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:57,425 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-13 23:20:57,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:57,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 23:20:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:57,427 INFO L225 Difference]: With dead ends: 33 [2019-10-13 23:20:57,427 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 23:20:57,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:20:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 23:20:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 23:20:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 23:20:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 23:20:57,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-13 23:20:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:57,435 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 23:20:57,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 23:20:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:20:57,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:57,437 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:57,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:57,643 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 903502258, now seen corresponding path program 1 times [2019-10-13 23:20:57,644 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:57,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318887097] [2019-10-13 23:20:57,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:57,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:57,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:57,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318887097] [2019-10-13 23:20:57,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:57,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:57,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078256614] [2019-10-13 23:20:57,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:57,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:57,768 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-13 23:20:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:57,778 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 23:20:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:57,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:20:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:57,780 INFO L225 Difference]: With dead ends: 31 [2019-10-13 23:20:57,780 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 23:20:57,781 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 23:20:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 23:20:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 23:20:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 23:20:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 23:20:57,787 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-13 23:20:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:57,789 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 23:20:57,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 23:20:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 23:20:57,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:57,791 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:57,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2130547361, now seen corresponding path program 1 times [2019-10-13 23:20:57,792 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:57,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490933060] [2019-10-13 23:20:57,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:57,792 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:57,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:57,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490933060] [2019-10-13 23:20:57,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666016832] [2019-10-13 23:20:57,900 INFO L94 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-13 23:20:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:57,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:57,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:58,004 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:58,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729554208] [2019-10-13 23:20:58,091 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:58,092 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:58,100 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:58,113 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:58,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:58,247 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:00,187 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:00,245 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:00,250 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:00,250 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:00,251 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:00,251 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:00,251 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_29 Int) (v_sum_~ret~0_BEFORE_RETURN_5 Int) (v_sum_~ret~0_BEFORE_RETURN_6 Int) (v_prenex_30 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_29 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_29 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)))))) (and (exists ((v_prenex_29 Int) (v_sum_~ret~0_BEFORE_RETURN_5 Int) (v_sum_~ret~0_BEFORE_RETURN_6 Int) (v_prenex_30 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= (mod v_prenex_29 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_prenex_29 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_6 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:00,252 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:00,252 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:21:00,252 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 23:21:00,252 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 23:21:00,253 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_1 Int) (v_sum_~ret~0_BEFORE_RETURN_1 Int)) (or (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) |main_#t~ret4|) (not (< main_~i~1 5))) (and (not (< main_~i~1 5)) (= |main_#t~ret4| (+ (mod v_prenex_1 4294967296) (- 4294967296))) (not (<= (mod v_prenex_1 4294967296) 2147483647))))) (exists ((v_prenex_2 Int) (v_sum_~ret~0_BEFORE_RETURN_2 Int)) (or (and (not (< main_~i~1 5)) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647)) (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 5)))))) [2019-10-13 23:21:00,253 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:00,253 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:00,255 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(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 23:21:00,255 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:00,255 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:00,255 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:00,255 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:00,256 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:21:00,256 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (v_sum_~ret~0_BEFORE_RETURN_1 Int) (v_sum_~ret~0_BEFORE_RETURN_2 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_prenex_1 4294967296) (- 4294967296))) (not (<= (mod v_prenex_1 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_1 4294967296)) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sum_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:00,256 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:00,257 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 5 sum_~i~0) (not (< sum_~i~0 5))) [2019-10-13 23:21:00,618 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:00,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:21:00,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790479796] [2019-10-13 23:21:00,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:21:00,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:21:00,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:00,623 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 23:21:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:01,247 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-13 23:21:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:21:01,248 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-13 23:21:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:01,251 INFO L225 Difference]: With dead ends: 40 [2019-10-13 23:21:01,251 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 23:21:01,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:21:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 23:21:01,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 23:21:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 23:21:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-13 23:21:01,263 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-13 23:21:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:01,264 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-13 23:21:01,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:21:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-13 23:21:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 23:21:01,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:01,266 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:01,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:01,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:01,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:01,475 INFO L82 PathProgramCache]: Analyzing trace with hash 356639231, now seen corresponding path program 2 times [2019-10-13 23:21:01,475 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:01,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79915180] [2019-10-13 23:21:01,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:01,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:01,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:21:01,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79915180] [2019-10-13 23:21:01,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480825618] [2019-10-13 23:21:01,621 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 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 23:21:01,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 23:21:01,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:01,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:21:01,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:21:01,744 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:21:01,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470832493] [2019-10-13 23:21:01,781 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:01,781 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:01,782 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:01,782 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:01,784 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:01,814 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:03,207 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:03,238 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:03,242 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:03,242 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:03,242 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:03,242 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:03,243 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_prenex_224 Int) (v_sum_~ret~0_BEFORE_RETURN_32 Int) (v_sum_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0)) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret2~0))) (and (exists ((v_prenex_224 Int) (v_sum_~ret~0_BEFORE_RETURN_32 Int) (v_sum_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0)) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:21:03,243 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:03,244 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:21:03,244 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 23:21:03,244 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 23:21:03,244 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_sum_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_195 Int)) (or (and (not (<= (mod v_prenex_195 4294967296) 2147483647)) (not (< main_~i~1 5)) (= (+ (mod v_prenex_195 4294967296) (- 4294967296)) |main_#t~ret4|)) (and (not (< main_~i~1 5)) (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)))) (exists ((v_prenex_196 Int) (v_sum_~ret~0_BEFORE_RETURN_28 Int)) (or (and (= |main_#t~ret4| (+ (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) (- 4294967296))) (not (< main_~i~1 5)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647))) (and (<= (mod v_prenex_196 4294967296) 2147483647) (not (< main_~i~1 5)) (= (mod v_prenex_196 4294967296) |main_#t~ret4|))))) [2019-10-13 23:21:03,260 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:03,260 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:03,260 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(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 23:21:03,261 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:03,261 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:03,261 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:03,262 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:03,262 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:21:03,262 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_sum_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_196 Int) (v_sum_~ret~0_BEFORE_RETURN_28 Int) (v_prenex_195 Int)) (or (and (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296)) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_sum_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_28 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (<= (mod v_prenex_196 4294967296) 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_prenex_196 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (<= (mod v_prenex_195 4294967296) 2147483647)) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_prenex_195 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:03,262 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:03,262 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 5 sum_~i~0) (not (< sum_~i~0 5))) [2019-10-13 23:21:03,605 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:03,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 23:21:03,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124077665] [2019-10-13 23:21:03,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 23:21:03,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:03,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 23:21:03,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:21:03,608 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-13 23:21:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:04,515 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-13 23:21:04,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:21:04,516 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 23:21:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:04,517 INFO L225 Difference]: With dead ends: 44 [2019-10-13 23:21:04,517 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 23:21:04,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 23:21:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 23:21:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-13 23:21:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 23:21:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-13 23:21:04,526 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-13 23:21:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:04,526 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-13 23:21:04,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 23:21:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-13 23:21:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:21:04,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:04,528 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:04,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:04,733 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:04,734 INFO L82 PathProgramCache]: Analyzing trace with hash 906031436, now seen corresponding path program 3 times [2019-10-13 23:21:04,734 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:04,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122162140] [2019-10-13 23:21:04,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:04,735 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:04,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 26 proven. 36 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-13 23:21:04,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122162140] [2019-10-13 23:21:04,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461901956] [2019-10-13 23:21:04,835 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 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 23:21:04,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:21:04,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:21:04,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 23:21:04,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-13 23:21:04,984 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-13 23:21:05,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [817184474] [2019-10-13 23:21:05,030 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:05,030 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:05,031 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:05,031 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:05,031 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:05,050 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:06,606 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:06,634 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:06,637 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:06,637 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:06,638 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:06,638 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:06,638 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_sum_~ret~0_BEFORE_RETURN_58 Int) (v_sum_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_prenex_417 4294967296) main_~ret5~0) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_sum_~ret~0_BEFORE_RETURN_58 Int) (v_sum_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647)) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_57 4294967296) (- 4294967296)) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_418 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_418 4294967296) (- 4294967296))) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= (mod v_prenex_417 4294967296) main_~ret5~0) (<= (mod v_prenex_417 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))))))) [2019-10-13 23:21:06,638 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:06,638 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:21:06,639 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 23:21:06,639 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 23:21:06,639 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_389 Int) (v_sum_~ret~0_BEFORE_RETURN_53 Int)) (or (and (not (<= (mod v_prenex_389 4294967296) 2147483647)) (not (< main_~i~1 5)) (= (+ (mod v_prenex_389 4294967296) (- 4294967296)) |main_#t~ret4|)) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647) (not (< main_~i~1 5))))) (exists ((v_sum_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) |main_#t~ret4|) (not (< main_~i~1 5)) (not (<= (mod v_prenex_390 4294967296) 2147483647))) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) |main_#t~ret4|) (<= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (not (< main_~i~1 5)))))) [2019-10-13 23:21:06,639 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:06,639 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:06,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(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 23:21:06,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:06,640 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:06,640 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:06,640 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:06,640 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:21:06,641 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_sum_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_389 Int) (v_sum_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_390 Int)) (or (and (<= main_~ret~1 2147483647) (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) main_~ret~1) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_sum_~ret~0_BEFORE_RETURN_54 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) main_~ret~1) (<= main_~ret~1 2147483647) (<= (mod v_sum_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (+ (mod v_prenex_389 4294967296) (- 4294967296))) (not (<= (mod v_prenex_389 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:06,641 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:06,641 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 5 sum_~i~0) (not (< sum_~i~0 5))) [2019-10-13 23:21:06,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:06,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 18 [2019-10-13 23:21:06,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402969890] [2019-10-13 23:21:06,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 23:21:06,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 23:21:06,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:21:06,947 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 19 states. [2019-10-13 23:21:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:09,729 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-13 23:21:09,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 23:21:09,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-10-13 23:21:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:09,731 INFO L225 Difference]: With dead ends: 47 [2019-10-13 23:21:09,731 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 23:21:09,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-10-13 23:21:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 23:21:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 23:21:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 23:21:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-13 23:21:09,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 42 [2019-10-13 23:21:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:09,739 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-13 23:21:09,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 23:21:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-13 23:21:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:21:09,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:09,740 INFO L380 BasicCegarLoop]: trace histogram [15, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:09,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:09,955 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash 886327137, now seen corresponding path program 4 times [2019-10-13 23:21:09,956 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:09,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536535380] [2019-10-13 23:21:09,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:09,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:09,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-13 23:21:10,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536535380] [2019-10-13 23:21:10,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939556365] [2019-10-13 23:21:10,077 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 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-13 23:21:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:10,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:21:10,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:21:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-13 23:21:10,232 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:21:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-13 23:21:10,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1833129695] [2019-10-13 23:21:10,253 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:21:10,253 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:21:10,253 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:21:10,253 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:21:10,254 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:21:10,269 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:21:11,487 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-13 23:21:11,510 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:21:11,513 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:21:11,513 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:21:11,514 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 639#(<= 0 sum_~i~0) [2019-10-13 23:21:11,514 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 648#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:21:11,514 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 234#(or (and (exists ((v_prenex_611 Int) (v_sum_~ret~0_BEFORE_RETURN_84 Int) (v_prenex_612 Int) (v_sum_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_prenex_611 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (mod v_prenex_612 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647) (not (< main_~i~2 4))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_611 Int) (v_sum_~ret~0_BEFORE_RETURN_84 Int) (v_prenex_612 Int) (v_sum_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (not (<= (mod v_prenex_611 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_611 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647)) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_612 4294967296) 2147483647) (= (mod v_prenex_612 4294967296) main_~ret5~0) (not (< main_~i~2 4))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (= main_~ret5~0 (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647) (not (< main_~i~2 4))))))) [2019-10-13 23:21:11,515 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 479#true [2019-10-13 23:21:11,515 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 522#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 16))) (<= 4 main_~i~2) (not (< main_~i~2 4))) [2019-10-13 23:21:11,515 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 23:21:11,515 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 23:21:11,516 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 120#(or (exists ((v_prenex_583 Int) (v_sum_~ret~0_BEFORE_RETURN_79 Int)) (or (and (= (mod v_prenex_583 4294967296) |main_#t~ret4|) (<= (mod v_prenex_583 4294967296) 2147483647) (not (< main_~i~1 5))) (and (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647)) (not (< main_~i~1 5)) (= (+ (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) (- 4294967296)) |main_#t~ret4|)))) (exists ((v_prenex_584 Int) (v_sum_~ret~0_BEFORE_RETURN_80 Int)) (or (and (= |main_#t~ret4| (+ (mod v_prenex_584 4294967296) (- 4294967296))) (not (< main_~i~1 5)) (not (<= (mod v_prenex_584 4294967296) 2147483647))) (and (not (< main_~i~1 5)) (= |main_#t~ret4| (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647))))) [2019-10-13 23:21:11,516 INFO L193 IcfgInterpreter]: Reachable states at location sumENTRY satisfy 601#true [2019-10-13 23:21:11,516 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 380#true [2019-10-13 23:21:11,516 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 653#(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 23:21:11,516 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:21:11,517 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 313#true [2019-10-13 23:21:11,517 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 587#true [2019-10-13 23:21:11,517 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 560#true [2019-10-13 23:21:11,517 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 5)) (<= 5 main_~i~1)) [2019-10-13 23:21:11,517 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 592#(exists ((v_prenex_583 Int) (v_sum_~ret~0_BEFORE_RETURN_79 Int) (v_prenex_584 Int) (v_sum_~ret~0_BEFORE_RETURN_80 Int)) (or (and (<= main_~ret~1 2147483647) (<= (mod v_prenex_583 4294967296) 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_prenex_583 4294967296)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (<= (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_sum_~ret~0_BEFORE_RETURN_79 4294967296) (- 4294967296))) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_584 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_prenex_584 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 5)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296)) (<= (mod v_sum_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:21:11,518 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:21:11,518 INFO L193 IcfgInterpreter]: Reachable states at location sumEXIT satisfy 644#(and (<= 0 sum_~i~0) (= |sum_#res| (ite (<= (mod sum_~ret~0 4294967296) 2147483647) (mod sum_~ret~0 4294967296) (+ (mod sum_~ret~0 4294967296) (- 4294967296)))) (<= 5 sum_~i~0) (not (< sum_~i~0 5))) [2019-10-13 23:21:11,813 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:21:11,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:21:11,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528686212] [2019-10-13 23:21:11,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:21:11,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:21:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:11,815 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 18 states. [2019-10-13 23:21:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:12,502 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-13 23:21:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:21:12,502 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-10-13 23:21:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:12,503 INFO L225 Difference]: With dead ends: 46 [2019-10-13 23:21:12,504 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 23:21:12,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:21:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 23:21:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-13 23:21:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 23:21:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-13 23:21:12,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 45 [2019-10-13 23:21:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:12,513 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-13 23:21:12,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:21:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-13 23:21:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:21:12,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:12,514 INFO L380 BasicCegarLoop]: trace histogram [15, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:12,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:21:12,726 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash -81363278, now seen corresponding path program 5 times [2019-10-13 23:21:12,727 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:12,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623072062] [2019-10-13 23:21:12,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:12,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:12,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:15,044 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-10-13 23:21:17,427 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 106 DAG size of output: 52 [2019-10-13 23:21:22,013 WARN L191 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2019-10-13 23:21:32,882 WARN L191 SmtUtils]: Spent 10.17 s on a formula simplification. DAG size of input: 70 DAG size of output: 31