java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-crafted/mapsum5.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:31:15,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:31:15,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:31:15,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:31:15,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:31:15,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:31:15,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:31:15,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:31:15,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:31:15,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:31:15,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:31:15,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:31:15,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:31:15,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:31:15,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:31:15,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:31:15,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:31:15,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:31:15,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:31:15,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:31:15,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:31:15,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:31:15,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:31:15,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:31:15,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:31:15,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:31:15,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:31:15,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:31:15,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:31:15,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:31:15,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:31:15,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:31:15,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:31:15,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:31:15,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:31:15,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:31:15,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:31:15,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:31:15,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:31:15,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:31:15,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:31:15,633 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 21:31:15,665 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:31:15,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:31:15,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:31:15,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:31:15,671 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:31:15,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:31:15,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:31:15,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:31:15,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:31:15,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:31:15,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:31:15,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:31:15,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:31:15,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:31:15,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:31:15,674 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:31:15,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:31:15,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:31:15,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:31:15,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:31:15,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:31:15,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:31:15,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:31:15,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:31:15,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:31:15,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:31:15,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:31:15,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:31:15,676 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 21:31:15,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:31:15,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:31:15,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:31:15,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:31:15,963 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:31:15,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum5.i [2019-10-13 21:31:16,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e522324be/f5567d129ec14413bd628b4cce393e92/FLAG46990cb39 [2019-10-13 21:31:16,503 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:31:16,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5.i [2019-10-13 21:31:16,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e522324be/f5567d129ec14413bd628b4cce393e92/FLAG46990cb39 [2019-10-13 21:31:16,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e522324be/f5567d129ec14413bd628b4cce393e92 [2019-10-13 21:31:16,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:31:16,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:31:16,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:31:16,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:31:16,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:31:16,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:31:16" (1/1) ... [2019-10-13 21:31:16,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cea9706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:16, skipping insertion in model container [2019-10-13 21:31:16,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:31:16" (1/1) ... [2019-10-13 21:31:16,936 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:31:16,954 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:31:17,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:31:17,145 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:31:17,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:31:17,203 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:31:17,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17 WrapperNode [2019-10-13 21:31:17,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:31:17,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:31:17,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:31:17,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:31:17,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (1/1) ... [2019-10-13 21:31:17,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:31:17,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:31:17,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:31:17,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:31:17,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (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 21:31:17,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:31:17,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:31:17,382 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-10-13 21:31:17,382 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:31:17,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:31:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:31:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-10-13 21:31:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:31:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:31:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:31:17,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:31:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:31:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:31:17,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:31:17,761 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:31:17,762 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:31:17,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:31:17 BoogieIcfgContainer [2019-10-13 21:31:17,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:31:17,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:31:17,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:31:17,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:31:17,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:31:16" (1/3) ... [2019-10-13 21:31:17,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f50d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:31:17, skipping insertion in model container [2019-10-13 21:31:17,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:31:17" (2/3) ... [2019-10-13 21:31:17,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f50d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:31:17, skipping insertion in model container [2019-10-13 21:31:17,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:31:17" (3/3) ... [2019-10-13 21:31:17,771 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum5.i [2019-10-13 21:31:17,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:31:17,788 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:31:17,798 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:31:17,820 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:31:17,820 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:31:17,820 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:31:17,820 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:31:17,820 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:31:17,820 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:31:17,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:31:17,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:31:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-13 21:31:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:31:17,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:17,844 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 21:31:17,845 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1426255065, now seen corresponding path program 1 times [2019-10-13 21:31:17,859 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:17,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500687001] [2019-10-13 21:31:17,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:17,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:17,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:18,127 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 21:31:18,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500687001] [2019-10-13 21:31:18,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:31:18,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:31:18,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021204881] [2019-10-13 21:31:18,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:31:18,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:31:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:31:18,164 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-13 21:31:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:18,255 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-13 21:31:18,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:31:18,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:31:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:18,269 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:31:18,269 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:31:18,275 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 21:31:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:31:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:31:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:31:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:31:18,334 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-13 21:31:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:18,336 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:31:18,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:31:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:31:18,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:31:18,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:18,340 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, 1] [2019-10-13 21:31:18,341 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:18,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:18,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1318016053, now seen corresponding path program 1 times [2019-10-13 21:31:18,342 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:18,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244980162] [2019-10-13 21:31:18,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:18,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:18,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:18,470 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 21:31:18,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244980162] [2019-10-13 21:31:18,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457403392] [2019-10-13 21:31:18,471 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 21:31:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:18,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:31:18,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:31:18,617 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:31:18,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621744623] [2019-10-13 21:31:18,703 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:31:18,704 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:18,710 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:18,719 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:18,720 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:18,912 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:31:20,555 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-13 21:31:20,567 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:31:20,572 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:20,572 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:20,572 INFO L193 IcfgInterpreter]: Reachable states at location mapsumENTRY satisfy 480#true [2019-10-13 21:31:20,573 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 38#(and (<= ~N~0 2147483647) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:31:20,573 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 96#(and (<= ~N~0 0) (not (< main_~i~1 ~N~0)) (<= 0 |main_#t~ret5|) (= 0 |main_#t~ret5|) (<= |main_#t~ret5| 0)) [2019-10-13 21:31:20,573 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 339#(and (or (and (<= 0 (+ main_~ret2~0 2147483648)) (<= 0 main_~ret2~0) (<= ~N~0 0) (<= main_~ret~1 0) (not (< main_~i~1 ~N~0)) (<= main_~ret2~0 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret5~0 0) (<= main_~ret2~0 2147483647) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (<= 0 (+ main_~ret~1 2147483648)) (<= 0 main_~ret~1) (<= main_~ret~1 2147483647) (= main_~ret2~0 0) (<= main_~ret5~0 0) (= main_~ret~1 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (and (<= 0 main_~ret2~0) (<= ~N~0 0) (<= main_~ret~1 0) (not (< main_~i~1 ~N~0)) (<= main_~ret2~0 0) (<= main_~ret5~0 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 0) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (<= 0 main_~ret~1) (= main_~ret2~0 0) (<= main_~ret5~0 0) (= main_~ret~1 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0))) (<= 0 main_~ret5~0) (<= main_~i~2 0) (<= 0 main_~i~2)) [2019-10-13 21:31:20,574 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 494#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:20,574 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 198#false [2019-10-13 21:31:20,574 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 255#false [2019-10-13 21:31:20,574 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 466#(and (<= 0 main_~ret~1) (<= ~N~0 0) (<= main_~ret~1 0) (not (< main_~i~1 ~N~0)) (<= 0 |main_#t~ret8|) (<= |main_#t~ret8| 0) (= main_~ret~1 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= 0 |main_#t~ret8|)) [2019-10-13 21:31:20,575 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 449#(and (<= main_~i~2 0) (and (<= 0 main_~ret~1) (<= 0 main_~ret2~0) (<= ~N~0 0) (<= main_~ret~1 0) (not (< main_~i~1 ~N~0)) (= main_~ret2~0 0) (<= main_~ret2~0 0) (= main_~ret~1 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~i~2 0)) (<= 0 main_~i~2)) [2019-10-13 21:31:20,575 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0)) [2019-10-13 21:31:20,575 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 485#(and (<= 0 mapsum_~ret~0) (= mapsum_~ret~0 0) (<= mapsum_~i~0 0) (= 0 mapsum_~i~0) (= |mapsum_#in~x.base| mapsum_~x.base) (<= 0 mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (<= mapsum_~ret~0 0)) [2019-10-13 21:31:20,576 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 471#(and (<= 0 main_~ret~1) (<= ~N~0 0) (<= main_~ret~1 0) (not (< main_~i~1 ~N~0)) (= main_~ret~1 0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4)))) [2019-10-13 21:31:20,576 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true [2019-10-13 21:31:20,577 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:20,578 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 ~N~0) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#memory_int| |old(#memory_int)|) (<= |old(~N~0)| 0) (<= 0 |old(~N~0)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:31:20,578 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 499#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:20,578 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:20,579 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 382#(and (and (<= 0 main_~ret2~0) (<= ~N~0 0) (<= main_~ret~1 0) (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (<= 0 main_~ret~1) (= main_~ret2~0 0) (= main_~ret~1 0) (= |main_#t~ret12| 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (<= main_~ret2~0 0) (<= |main_#t~ret12| 0) (<= main_~i~2 0) (<= 0 |main_#t~ret12|) (<= 0 main_~i~2)) [2019-10-13 21:31:20,579 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 413#(and (<= 0 main_~ret2~0) (and (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (<= 0 main_~ret~1) (= main_~ret2~0 0) (= main_~ret~1 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (<= ~N~0 0) (<= main_~ret~1 0) (<= main_~ret2~0 0) (<= main_~i~2 0) (<= 0 main_~i~2)) [2019-10-13 21:31:20,580 INFO L193 IcfgInterpreter]: Reachable states at location mapsumEXIT satisfy 490#(and (<= ~N~0 0) (= (ite (<= (mod mapsum_~ret~0 4294967296) 2147483647) (mod mapsum_~ret~0 4294967296) (+ (mod mapsum_~ret~0 4294967296) (- 4294967296))) |mapsum_#res|) (<= 0 mapsum_~ret~0) (= mapsum_~ret~0 0) (not (< mapsum_~i~0 ~N~0)) (<= mapsum_~i~0 0) (= 0 mapsum_~i~0) (= |mapsum_#in~x.base| mapsum_~x.base) (<= 0 mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (<= mapsum_~ret~0 0)) [2019-10-13 21:31:21,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:31:21,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 4, 4] total 24 [2019-10-13 21:31:21,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800712952] [2019-10-13 21:31:21,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:31:21,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:31:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:31:21,480 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 17 states. [2019-10-13 21:31:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:21,865 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-10-13 21:31:21,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:31:21,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-10-13 21:31:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:21,870 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:31:21,870 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 21:31:21,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:31:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 21:31:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-10-13 21:31:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:31:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-10-13 21:31:21,891 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 26 [2019-10-13 21:31:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:21,891 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-10-13 21:31:21,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:31:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-10-13 21:31:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:31:21,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:21,895 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, 1, 1] [2019-10-13 21:31:22,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:22,099 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:22,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:22,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1395603433, now seen corresponding path program 1 times [2019-10-13 21:31:22,099 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:22,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25950607] [2019-10-13 21:31:22,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:22,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:22,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:31:22,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25950607] [2019-10-13 21:31:22,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133304940] [2019-10-13 21:31:22,211 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 21:31:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:22,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:31:22,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:31:22,324 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:31:22,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1738035585] [2019-10-13 21:31:22,356 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:31:22,356 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:22,357 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:22,357 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:22,358 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:22,397 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-13 21:31:23,879 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-13 21:31:23,927 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:31:23,932 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:23,932 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:23,932 INFO L193 IcfgInterpreter]: Reachable states at location mapsumENTRY satisfy 543#true [2019-10-13 21:31:23,933 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 38#(and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= 0 |old(~N~0)|) (<= |old(~N~0)| 0) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:31:23,933 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 125#(or (exists ((v_mapsum_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_1 Int)) (or (and (= (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) |main_#t~ret5|) (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (not (< main_~i~1 ~N~0))) (and (not (< main_~i~1 ~N~0)) (= (mod v_prenex_1 4294967296) |main_#t~ret5|) (<= (mod v_prenex_1 4294967296) 2147483647)))) (exists ((v_prenex_2 Int) (v_mapsum_~ret~0_BEFORE_RETURN_28 Int)) (or (and (not (< main_~i~1 ~N~0)) (= (mod v_prenex_2 4294967296) |main_#t~ret5|) (<= (mod v_prenex_2 4294967296) 2147483647)) (and (= (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_28 4294967296) (- 4294967296)) |main_#t~ret5|) (not (< main_~i~1 ~N~0)) (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647)))))) [2019-10-13 21:31:23,933 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 396#true [2019-10-13 21:31:23,933 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 590#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:23,934 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 230#(or (and (not (= main_~ret~1 main_~ret5~0)) (exists ((v_mapsum_~ret~0_BEFORE_RETURN_32 Int) (v_mapsum_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_29 Int) (v_prenex_30 Int)) (or (and (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0)))))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_mapsum_~ret~0_BEFORE_RETURN_32 Int) (v_mapsum_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_29 Int) (v_prenex_30 Int)) (or (and (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296))) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))))))) [2019-10-13 21:31:23,935 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 300#true [2019-10-13 21:31:23,935 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 529#true [2019-10-13 21:31:23,936 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 512#true [2019-10-13 21:31:23,936 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0)) [2019-10-13 21:31:23,936 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 581#(<= 0 mapsum_~i~0) [2019-10-13 21:31:23,936 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 534#(exists ((v_prenex_2 Int) (v_mapsum_~ret~0_BEFORE_RETURN_27 Int) (v_prenex_1 Int) (v_mapsum_~ret~0_BEFORE_RETURN_28 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647)) (= (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_28 4294967296) (- 4294967296)) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 ~N~0)) (= main_~ret~1 (mod v_prenex_2 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_2 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (= main_~ret~1 (mod v_prenex_1 4294967296)) (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_1 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 21:31:23,937 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true [2019-10-13 21:31:23,937 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:23,937 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= 0 |old(~N~0)|) (<= 0 ~N~0) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#memory_int| |old(#memory_int)|) (<= 0 |old(~N~0)|) (<= |old(~N~0)| 0) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:31:23,938 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 595#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:23,938 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:23,938 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 442#true [2019-10-13 21:31:23,940 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 476#(and (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) [2019-10-13 21:31:23,940 INFO L193 IcfgInterpreter]: Reachable states at location mapsumEXIT satisfy 586#(and (= (ite (<= (mod mapsum_~ret~0 4294967296) 2147483647) (mod mapsum_~ret~0 4294967296) (+ (mod mapsum_~ret~0 4294967296) (- 4294967296))) |mapsum_#res|) (not (< mapsum_~i~0 ~N~0)) (<= 0 mapsum_~i~0)) [2019-10-13 21:31:24,478 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:24,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 12] total 20 [2019-10-13 21:31:24,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475900303] [2019-10-13 21:31:24,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:31:24,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:24,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:31:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:31:24,481 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 21 states. [2019-10-13 21:31:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:25,129 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2019-10-13 21:31:25,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:31:25,130 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-10-13 21:31:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:25,132 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:31:25,132 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 21:31:25,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:31:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 21:31:25,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-13 21:31:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 21:31:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-13 21:31:25,144 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 27 [2019-10-13 21:31:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:25,144 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-13 21:31:25,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:31:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-13 21:31:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:31:25,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:25,146 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:25,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:25,350 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash 108787747, now seen corresponding path program 2 times [2019-10-13 21:31:25,351 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:25,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949865005] [2019-10-13 21:31:25,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:25,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:25,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:31:25,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949865005] [2019-10-13 21:31:25,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:31:25,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:31:25,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159777311] [2019-10-13 21:31:25,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:31:25,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:25,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:31:25,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:31:25,420 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-10-13 21:31:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:25,462 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-10-13 21:31:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:31:25,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-13 21:31:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:25,464 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:31:25,464 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:31:25,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:31:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:31:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-13 21:31:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:31:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-10-13 21:31:25,475 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2019-10-13 21:31:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:25,476 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-13 21:31:25,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:31:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-10-13 21:31:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:31:25,485 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:25,485 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:25,485 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1067802980, now seen corresponding path program 1 times [2019-10-13 21:31:25,486 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:25,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222338507] [2019-10-13 21:31:25,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:25,487 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:25,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:31:25,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222338507] [2019-10-13 21:31:25,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282895240] [2019-10-13 21:31:25,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:31:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:25,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:31:25,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:31:25,744 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 21:31:25,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1810230857] [2019-10-13 21:31:25,808 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 21:31:25,808 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:31:25,809 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:31:25,809 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:31:25,809 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:31:25,829 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-13 21:31:27,189 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-13 21:31:27,215 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:31:27,218 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:31:27,218 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:31:27,218 INFO L193 IcfgInterpreter]: Reachable states at location mapsumENTRY satisfy 606#true [2019-10-13 21:31:27,219 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 38#(and (= 0 |#NULL.base|) (<= ~N~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 (+ ~N~0 2147483648)) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= 0 |old(~N~0)|) (<= |old(~N~0)| 0) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:31:27,219 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 125#(or (exists ((v_mapsum_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_196 Int)) (or (and (<= (mod v_prenex_196 4294967296) 2147483647) (not (< main_~i~1 ~N~0)) (= (mod v_prenex_196 4294967296) |main_#t~ret5|)) (and (not (< main_~i~1 ~N~0)) (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647)) (= |main_#t~ret5| (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_54 4294967296) (- 4294967296)))))) (exists ((v_mapsum_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_195 Int)) (or (and (= |main_#t~ret5| (mod v_prenex_195 4294967296)) (not (< main_~i~1 ~N~0)) (<= (mod v_prenex_195 4294967296) 2147483647)) (and (= (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296)) |main_#t~ret5|) (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647)) (not (< main_~i~1 ~N~0)))))) [2019-10-13 21:31:27,219 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 429#true [2019-10-13 21:31:27,219 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 653#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:31:27,220 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 239#(or (and (exists ((v_prenex_224 Int) (v_mapsum_~ret~0_BEFORE_RETURN_58 Int) (v_mapsum_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_223 Int)) (or (and (not (<= (mod v_prenex_224 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_224 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296)) (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_223 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_mapsum_~ret~0_BEFORE_RETURN_58 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_224 Int) (v_mapsum_~ret~0_BEFORE_RETURN_58 Int) (v_mapsum_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_223 Int)) (or (and (not (<= (mod v_prenex_224 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (= main_~ret5~0 (+ (mod v_prenex_224 4294967296) (- 4294967296))) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296)) (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_223 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) (and (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_mapsum_~ret~0_BEFORE_RETURN_58 4294967296)) (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))))))) [2019-10-13 21:31:27,220 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 318#true [2019-10-13 21:31:27,220 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 592#true [2019-10-13 21:31:27,220 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 565#true [2019-10-13 21:31:27,220 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0)) [2019-10-13 21:31:27,220 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 644#(<= 0 mapsum_~i~0) [2019-10-13 21:31:27,221 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 597#(exists ((v_mapsum_~ret~0_BEFORE_RETURN_54 Int) (v_mapsum_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_196 Int) (v_prenex_195 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_prenex_195 4294967296) main_~ret~1) (<= (mod v_prenex_195 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (<= (mod v_prenex_196 4294967296) 2147483647) (not (< main_~i~1 ~N~0)) (= 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) (= main_~ret~1 (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_54 4294967296) (- 4294967296))) (not (< main_~i~1 ~N~0)) (not (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647)) (= 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_mapsum_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_mapsum_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 21:31:27,221 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true [2019-10-13 21:31:27,221 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:27,221 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 |old(~N~0)|) (<= 0 ~N~0) (= |#valid| |old(#valid)|) (= ~N~0 |old(~N~0)|) (= |#memory_int| |old(#memory_int)|) (<= 0 |old(~N~0)|) (<= |old(~N~0)| 0) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-13 21:31:27,221 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 658#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 ~N~0) (= 0 |#NULL.base|) (<= 0 ~N~0) (<= |#NULL.base| 0) (<= ~N~0 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:31:27,222 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:31:27,222 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 484#true [2019-10-13 21:31:27,222 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 527#(and (= (select (select |#memory_int| |main_~#x~0.base|) (+ (* ~N~0 4) |main_~#x~0.offset| (- 4))) main_~temp~0) (not (< (+ main_~i~2 1) ~N~0))) [2019-10-13 21:31:27,222 INFO L193 IcfgInterpreter]: Reachable states at location mapsumEXIT satisfy 649#(and (= (ite (<= (mod mapsum_~ret~0 4294967296) 2147483647) (mod mapsum_~ret~0 4294967296) (+ (mod mapsum_~ret~0 4294967296) (- 4294967296))) |mapsum_#res|) (not (< mapsum_~i~0 ~N~0)) (<= 0 mapsum_~i~0)) [2019-10-13 21:31:27,705 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:31:27,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 12] total 21 [2019-10-13 21:31:27,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80743242] [2019-10-13 21:31:27,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 21:31:27,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:31:27,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 21:31:27,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-10-13 21:31:27,709 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 22 states. [2019-10-13 21:31:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:31:28,858 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-10-13 21:31:28,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:31:28,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-13 21:31:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:31:28,859 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:31:28,860 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 21:31:28,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 21:31:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 21:31:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 21:31:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:31:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-13 21:31:28,866 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 31 [2019-10-13 21:31:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:31:28,866 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-13 21:31:28,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 21:31:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-13 21:31:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:31:28,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:31:28,867 INFO L380 BasicCegarLoop]: trace histogram [6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:31:29,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:31:29,071 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:31:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:31:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1271027170, now seen corresponding path program 2 times [2019-10-13 21:31:29,072 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:31:29,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959259705] [2019-10-13 21:31:29,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:29,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:31:29,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:31:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:31:30,227 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-10-13 21:31:30,372 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-13 21:31:30,591 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-10-13 21:31:30,811 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-10-13 21:31:31,099 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-13 21:31:31,389 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-10-13 21:31:31,644 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2019-10-13 21:31:31,947 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-10-13 21:31:32,190 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-10-13 21:31:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:31:32,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959259705] [2019-10-13 21:31:32,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423588932] [2019-10-13 21:31:32,389 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 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 21:31:32,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:31:32,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:31:32,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-13 21:31:32,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:31:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:31:35,016 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:31:40,867 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-13 21:31:40,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6