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-36ac518-m [2019-10-06 23:01:14,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:01:14,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:01:14,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:01:14,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:01:14,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:01:14,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:01:14,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:01:14,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:01:14,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:01:14,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:01:14,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:01:14,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:01:14,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:01:14,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:01:14,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:01:14,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:01:14,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:01:14,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:01:14,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:01:14,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:01:14,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:01:14,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:01:14,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:01:14,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:01:14,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:01:14,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:01:14,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:01:14,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:01:14,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:01:14,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:01:14,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:01:14,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:01:14,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:01:14,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:01:14,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:01:14,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:01:14,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:01:14,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:01:14,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:01:14,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:01:14,641 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:01:14,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:01:14,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:01:14,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:01:14,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:01:14,678 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:01:14,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:01:14,681 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:01:14,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:01:14,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:01:14,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:01:14,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:01:14,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:01:14,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:01:14,683 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:01:14,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:01:14,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:01:14,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:01:14,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:01:14,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:01:14,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:01:14,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:01:14,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:01:14,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:01:14,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:01:14,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:01:14,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:01:14,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:01:14,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:01:14,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:01:14,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:01:14,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:01:14,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:01:14,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:01:14,991 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:01:14,991 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-06 23:01:15,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e370b76d4/f6687e6f4cc54d48a48274920e43fc38/FLAGfaada7dce [2019-10-06 23:01:15,543 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:01:15,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5.i [2019-10-06 23:01:15,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e370b76d4/f6687e6f4cc54d48a48274920e43fc38/FLAGfaada7dce [2019-10-06 23:01:15,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e370b76d4/f6687e6f4cc54d48a48274920e43fc38 [2019-10-06 23:01:15,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:01:15,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:01:15,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:01:15,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:01:15,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:01:15,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:01:15" (1/1) ... [2019-10-06 23:01:15,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cba5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:15, skipping insertion in model container [2019-10-06 23:01:15,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:01:15" (1/1) ... [2019-10-06 23:01:16,004 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:01:16,023 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:01:16,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:01:16,269 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:01:16,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:01:16,304 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:01:16,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16 WrapperNode [2019-10-06 23:01:16,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:01:16,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:01:16,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:01:16,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:01:16,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... [2019-10-06 23:01:16,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... [2019-10-06 23:01:16,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... [2019-10-06 23:01:16,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... [2019-10-06 23:01:16,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... [2019-10-06 23:01:16,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... [2019-10-06 23:01:16,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... [2019-10-06 23:01:16,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:01:16,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:01:16,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:01:16,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:01:16,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:01:16,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:01:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:01:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-10-06 23:01:16,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:01:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:01:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:01:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-10-06 23:01:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:01:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:01:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:01:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:01:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:01:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:01:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:01:16,849 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:01:16,850 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:01:16,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:01:16 BoogieIcfgContainer [2019-10-06 23:01:16,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:01:16,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:01:16,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:01:16,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:01:16,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:01:15" (1/3) ... [2019-10-06 23:01:16,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ff5f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:01:16, skipping insertion in model container [2019-10-06 23:01:16,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:01:16" (2/3) ... [2019-10-06 23:01:16,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ff5f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:01:16, skipping insertion in model container [2019-10-06 23:01:16,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:01:16" (3/3) ... [2019-10-06 23:01:16,860 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum5.i [2019-10-06 23:01:16,870 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:01:16,879 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:01:16,891 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:01:16,918 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:01:16,918 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:01:16,918 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:01:16,918 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:01:16,919 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:01:16,919 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:01:16,919 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:01:16,919 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:01:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-06 23:01:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-06 23:01:16,940 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:16,941 INFO L385 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-06 23:01:16,942 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:16,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1426255065, now seen corresponding path program 1 times [2019-10-06 23:01:16,954 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:16,954 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:16,955 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:16,955 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:17,201 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-06 23:01:17,202 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:17,202 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:01:17,203 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:01:17,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:01:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:01:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:01:17,225 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-06 23:01:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:17,286 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-06 23:01:17,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:01:17,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-06 23:01:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:17,297 INFO L225 Difference]: With dead ends: 44 [2019-10-06 23:01:17,298 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:01:17,301 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:01:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:01:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:01:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:01:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:01:17,345 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-06 23:01:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:17,345 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:01:17,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:01:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:01:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:01:17,348 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:17,348 INFO L385 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-06 23:01:17,349 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1318016053, now seen corresponding path program 1 times [2019-10-06 23:01:17,350 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:17,350 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:17,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:17,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:17,459 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-06 23:01:17,460 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:17,460 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:17,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:01:17,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:17,609 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-06 23:01:17,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:17,659 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-06 23:01:17,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:17,692 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:01:17,692 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:17,701 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:17,711 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:17,713 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:17,980 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:01:19,549 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-06 23:01:19,557 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:19,562 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:19,562 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:19,563 INFO L193 IcfgInterpreter]: Reachable states at location mapsumENTRY satisfy 480#true [2019-10-06 23:01:19,563 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-06 23:01:19,564 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-06 23:01:19,564 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 339#(and (or (and (<= 0 (+ main_~ret2~0 2147483648)) (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~ret5~0 0) (<= main_~ret2~0 2147483647) (<= 0 (+ main_~ret~1 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret~1 2147483647) (= main_~ret2~0 0) (= main_~ret~1 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (and (not (< main_~i~1 ~N~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) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret2~0 0) (= main_~ret~1 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0))) (<= 0 main_~ret~1) (<= 0 main_~ret2~0) (<= ~N~0 0) (<= main_~ret~1 0) (<= main_~ret5~0 0) (<= main_~ret2~0 0) (<= 0 main_~ret5~0) (<= main_~i~2 0) (<= 0 main_~i~2)) [2019-10-06 23:01:19,564 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-06 23:01:19,564 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 255#false [2019-10-06 23:01:19,565 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-06 23:01:19,565 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-06 23:01:19,565 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0)) [2019-10-06 23:01:19,565 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-06 23:01:19,566 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-06 23:01:19,566 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true [2019-10-06 23:01:19,567 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-06 23:01:19,567 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-06 23:01:19,568 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-06 23:01:19,569 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:19,570 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 198#false [2019-10-06 23:01:19,570 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|)) (<= 0 main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= 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-06 23:01:19,570 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 413#(and (and (not (< main_~i~1 ~N~0)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret2~0 0) (= main_~ret~1 0) (not (< (+ main_~i~2 1) ~N~0)) (= main_~i~2 0)) (<= 0 main_~ret~1) (<= 0 main_~ret2~0) (<= ~N~0 0) (<= main_~ret~1 0) (<= main_~ret2~0 0) (<= main_~i~2 0) (<= 0 main_~i~2)) [2019-10-06 23:01:19,571 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-06 23:01:20,332 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:01:20,333 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 4, 4] total 24 [2019-10-06 23:01:20,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:01:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:01:20,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:01:20,341 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 17 states. [2019-10-06 23:01:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:20,705 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-10-06 23:01:20,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:01:20,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-10-06 23:01:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:20,708 INFO L225 Difference]: With dead ends: 44 [2019-10-06 23:01:20,709 INFO L226 Difference]: Without dead ends: 33 [2019-10-06 23:01:20,710 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-10-06 23:01:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-06 23:01:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-10-06 23:01:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:01:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-10-06 23:01:20,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 26 [2019-10-06 23:01:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:20,721 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-10-06 23:01:20,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:01:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-10-06 23:01:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:01:20,723 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:20,723 INFO L385 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-06 23:01:20,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:20,933 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1395603433, now seen corresponding path program 1 times [2019-10-06 23:01:20,933 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:20,933 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:20,934 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:20,934 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:21,043 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-06 23:01:21,043 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:21,044 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:21,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:01:21,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:21,151 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-06 23:01:21,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:21,184 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-06 23:01:21,184 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:21,186 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:01:21,186 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:21,187 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:21,188 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:21,188 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:21,221 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:01:22,629 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-06 23:01:22,665 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:22,669 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:22,669 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:22,669 INFO L193 IcfgInterpreter]: Reachable states at location mapsumENTRY satisfy 543#true [2019-10-06 23:01:22,670 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-06 23:01:22,670 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-06 23:01:22,670 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 396#true [2019-10-06 23:01:22,671 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-06 23:01:22,671 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 300#true [2019-10-06 23:01:22,671 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 529#true [2019-10-06 23:01:22,671 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 512#true [2019-10-06 23:01:22,671 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0)) [2019-10-06 23:01:22,672 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 581#(<= 0 mapsum_~i~0) [2019-10-06 23:01:22,672 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-06 23:01:22,672 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true [2019-10-06 23:01:22,672 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-06 23:01:22,673 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-06 23:01:22,673 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-06 23:01:22,673 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:22,673 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 230#(or (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 (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (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))) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~2 1) ~N~0))) (and (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (not (< (+ main_~i~2 1) ~N~0)))))) (and (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 (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (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))) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_prenex_30 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_prenex_30 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~2 1) ~N~0))) (and (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_mapsum_~ret~0_BEFORE_RETURN_31 4294967296) main_~ret5~0) (not (< (+ main_~i~2 1) ~N~0))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-06 23:01:22,674 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 442#true [2019-10-06 23:01:22,674 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 476#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (< (+ main_~i~2 1) ~N~0))) [2019-10-06 23:01:22,674 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-06 23:01:23,158 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:23,159 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 11] total 19 [2019-10-06 23:01:23,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-06 23:01:23,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-06 23:01:23,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-10-06 23:01:23,161 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 20 states. [2019-10-06 23:01:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:23,741 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2019-10-06 23:01:23,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:01:23,741 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-10-06 23:01:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:23,742 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:01:23,742 INFO L226 Difference]: Without dead ends: 23 [2019-10-06 23:01:23,743 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:01:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-06 23:01:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-06 23:01:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-06 23:01:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-06 23:01:23,749 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 27 [2019-10-06 23:01:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:23,749 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-06 23:01:23,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-06 23:01:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-10-06 23:01:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:01:23,751 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:23,751 INFO L385 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-06 23:01:23,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:23,963 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash 108787747, now seen corresponding path program 2 times [2019-10-06 23:01:23,964 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:23,964 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:23,964 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:23,964 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:24,053 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-06 23:01:24,054 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:24,054 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:01:24,054 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:01:24,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:01:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:01:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:01:24,055 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-10-06 23:01:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:24,085 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2019-10-06 23:01:24,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:01:24,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-06 23:01:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:24,086 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:01:24,086 INFO L226 Difference]: Without dead ends: 24 [2019-10-06 23:01:24,087 INFO L606 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-06 23:01:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-06 23:01:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-06 23:01:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:01:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-10-06 23:01:24,092 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2019-10-06 23:01:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:24,093 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-06 23:01:24,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:01:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-10-06 23:01:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-06 23:01:24,094 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:24,094 INFO L385 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-06 23:01:24,094 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1067802980, now seen corresponding path program 1 times [2019-10-06 23:01:24,095 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:24,095 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:24,095 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:24,095 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:24,157 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-06 23:01:24,158 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:24,158 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:24,158 INFO L95 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-06 23:01:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:24,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:01:24,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:24,310 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-06 23:01:24,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:24,475 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-06 23:01:24,476 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:01:24,477 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:01:24,477 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:01:24,478 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:01:24,478 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:01:24,478 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:01:24,501 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:01:25,985 INFO L199 IcfgInterpreter]: Interpreting procedure mapsum with input of size 1 for LOIs [2019-10-06 23:01:26,012 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:01:26,016 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:01:26,016 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:01:26,016 INFO L193 IcfgInterpreter]: Reachable states at location mapsumENTRY satisfy 606#true [2019-10-06 23:01:26,017 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-06 23:01:26,017 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-06 23:01:26,017 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 429#true [2019-10-06 23:01:26,017 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-06 23:01:26,017 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 318#true [2019-10-06 23:01:26,018 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 592#true [2019-10-06 23:01:26,018 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 565#true [2019-10-06 23:01:26,018 INFO L193 IcfgInterpreter]: Reachable states at location L29-4 satisfy 78#(not (< main_~i~1 ~N~0)) [2019-10-06 23:01:26,018 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 644#(<= 0 mapsum_~i~0) [2019-10-06 23:01:26,018 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-06 23:01:26,019 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 73#true [2019-10-06 23:01:26,019 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-06 23:01:26,019 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-06 23:01:26,019 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-06 23:01:26,019 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:01:26,020 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 (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (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)) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (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)) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_223 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (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 (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (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)) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~ret5~0 (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (mod v_mapsum_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (not (< (+ main_~i~2 1) ~N~0))) (and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= (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)) (not (< (+ main_~i~2 1) ~N~0))) (and (not (<= (mod v_prenex_223 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (<= main_~ret5~0 2147483647) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_prenex_223 4294967296) (- 4294967296))) (not (< (+ main_~i~2 1) ~N~0))))))) [2019-10-06 23:01:26,020 INFO L193 IcfgInterpreter]: Reachable states at location L42-1 satisfy 484#true [2019-10-06 23:01:26,020 INFO L193 IcfgInterpreter]: Reachable states at location L42 satisfy 527#(and (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ (* 4 ~N~0) |main_~#x~0.offset| (- 4)))) (not (< (+ main_~i~2 1) ~N~0))) [2019-10-06 23:01:26,020 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-06 23:01:26,505 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:01:26,506 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 12] total 21 [2019-10-06 23:01:26,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-06 23:01:26,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-06 23:01:26,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-10-06 23:01:26,508 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 22 states. [2019-10-06 23:01:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:01:27,121 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-10-06 23:01:27,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:01:27,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-06 23:01:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:01:27,122 INFO L225 Difference]: With dead ends: 39 [2019-10-06 23:01:27,123 INFO L226 Difference]: Without dead ends: 25 [2019-10-06 23:01:27,124 INFO L606 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-06 23:01:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-06 23:01:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-06 23:01:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-06 23:01:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-06 23:01:27,129 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 31 [2019-10-06 23:01:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:01:27,129 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-06 23:01:27,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-06 23:01:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-06 23:01:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-06 23:01:27,130 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:01:27,131 INFO L385 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-06 23:01:27,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:27,336 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:01:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:01:27,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1271027170, now seen corresponding path program 2 times [2019-10-06 23:01:27,337 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:01:27,337 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:27,337 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:27,337 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:01:27,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:01:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:01:28,537 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-06 23:01:28,748 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-10-06 23:01:28,998 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-10-06 23:01:29,308 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-06 23:01:29,600 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-10-06 23:01:29,835 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-10-06 23:01:30,057 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-10-06 23:01:30,293 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-10-06 23:01:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:01:30,503 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:01:30,503 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:01:30,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:01:31,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:01:31,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:01:31,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 99 conjunts are in the unsatisfiable core [2019-10-06 23:01:31,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:01:31,981 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-10-06 23:01:33,131 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-10-06 23:01:35,085 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 137 [2019-10-06 23:01:35,602 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 136 [2019-10-06 23:01:36,091 WARN L191 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 135 [2019-10-06 23:01:36,351 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-10-06 23:01:36,631 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-10-06 23:01:39,305 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-06 23:01:39,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:01:44,018 WARN L191 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-06 23:01:44,026 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-06 23:02:10,918 WARN L191 SmtUtils]: Spent 20.29 s on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-10-06 23:02:44,066 WARN L191 SmtUtils]: Spent 30.59 s on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2019-10-06 23:02:56,023 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 79 [2019-10-06 23:02:56,028 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-10-06 23:02:59,908 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2019-10-06 23:02:59,916 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2019-10-06 23:03:05,703 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2019-10-06 23:03:05,711 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2019-10-06 23:03:07,869 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse55 (select |c_#memory_int| |c_mapsum_#in~x.base|)) (.cse53 (+ |c_mapsum_#in~x.offset| 4))) (let ((.cse25 (select .cse55 .cse53)) (.cse26 (select .cse55 |c_mapsum_#in~x.offset|))) (let ((.cse24 (mod (let ((.cse52 (let ((.cse54 (store (store .cse55 |c_mapsum_#in~x.offset| .cse25) .cse53 .cse26))) (store (store .cse54 |c_mapsum_#in~x.offset| .cse26) (+ (* 4 c_~N~0) |c_mapsum_#in~x.offset| (- 4)) (select .cse54 |c_mapsum_#in~x.offset|))))) (+ (select .cse52 |c_mapsum_#in~x.offset|) (select .cse52 .cse53) 1)) 4294967296)) (.cse27 (mod c_mapsum_~ret~0 4294967296))) (let ((.cse10 (<= .cse27 2147483647)) (.cse9 (forall ((v_mapsum_~i~0_81 Int)) (let ((.cse47 (mod (let ((.cse48 (let ((.cse51 (+ |c_mapsum_#in~x.offset| 4)) (.cse50 (select |c_#memory_int| |c_mapsum_#in~x.base|))) (store (store .cse50 |c_mapsum_#in~x.offset| (select .cse50 .cse51)) .cse51 (select .cse50 |c_mapsum_#in~x.offset|)))) (.cse49 (* 4 v_mapsum_~i~0_81))) (+ (* 2 v_mapsum_~i~0_81) (select .cse48 (+ .cse49 |c_mapsum_#in~x.offset| 4)) (select .cse48 (+ .cse49 |c_mapsum_#in~x.offset|)) 1)) 4294967296))) (or (< 2147483647 .cse47) (= (+ .cse47 4294967296) (mod c_mapsum_~ret~0 4294967296)) (<= c_~N~0 (+ v_mapsum_~i~0_81 1)) (< (+ v_mapsum_~i~0_81 2) c_~N~0))))) (.cse1 (forall ((v_mapsum_~i~0_81 Int)) (let ((.cse42 (mod (let ((.cse43 (let ((.cse46 (+ |c_mapsum_#in~x.offset| 4)) (.cse45 (select |c_#memory_int| |c_mapsum_#in~x.base|))) (store (store .cse45 |c_mapsum_#in~x.offset| (select .cse45 .cse46)) .cse46 (select .cse45 |c_mapsum_#in~x.offset|)))) (.cse44 (* 4 v_mapsum_~i~0_81))) (+ (* 2 v_mapsum_~i~0_81) (select .cse43 (+ .cse44 |c_mapsum_#in~x.offset| 4)) (select .cse43 (+ .cse44 |c_mapsum_#in~x.offset|)) 1)) 4294967296))) (or (< 2147483647 .cse42) (<= c_~N~0 (+ v_mapsum_~i~0_81 1)) (= (mod c_mapsum_~ret~0 4294967296) .cse42) (< (+ v_mapsum_~i~0_81 2) c_~N~0))))) (.cse8 (< 2147483647 .cse27)) (.cse7 (= .cse24 (+ .cse27 4294967296))) (.cse2 (exists ((v_prenex_433 Int)) (let ((.cse40 (select |c_#memory_int| |c_mapsum_#in~x.base|)) (.cse41 (+ |c_mapsum_#in~x.offset| 4))) (let ((.cse36 (select .cse40 .cse41)) (.cse37 (select .cse40 |c_mapsum_#in~x.offset|))) (let ((.cse35 (mod (let ((.cse38 (store (store .cse40 |c_mapsum_#in~x.offset| .cse36) .cse41 .cse37)) (.cse39 (* 4 v_prenex_433))) (+ (select .cse38 (+ .cse39 |c_mapsum_#in~x.offset|)) (select .cse38 (+ .cse39 |c_mapsum_#in~x.offset| 4)) (* 2 v_prenex_433) 1)) 4294967296))) (and (not (= .cse35 (mod (+ .cse36 .cse37 1) 4294967296))) (<= c_~N~0 (+ v_prenex_433 2)) (< 2147483647 .cse35) (< (+ v_prenex_433 1) c_~N~0))))))) (.cse3 (<= .cse24 2147483647)) (.cse4 (exists ((v_prenex_434 Int)) (let ((.cse33 (select |c_#memory_int| |c_mapsum_#in~x.base|)) (.cse34 (+ |c_mapsum_#in~x.offset| 4))) (let ((.cse29 (select .cse33 .cse34)) (.cse30 (select .cse33 |c_mapsum_#in~x.offset|))) (let ((.cse28 (mod (let ((.cse31 (store (store .cse33 |c_mapsum_#in~x.offset| .cse29) .cse34 .cse30)) (.cse32 (* 4 v_prenex_434))) (+ (select .cse31 (+ .cse32 |c_mapsum_#in~x.offset| 4)) (select .cse31 (+ .cse32 |c_mapsum_#in~x.offset|)) (* 2 v_prenex_434) 1)) 4294967296))) (and (<= .cse28 2147483647) (not (= .cse28 (mod (+ .cse29 .cse30 1) 4294967296))) (< (+ v_prenex_434 1) c_~N~0) (<= c_~N~0 (+ v_prenex_434 2)))))))) (.cse5 (= .cse27 .cse24)) (.cse0 (not (= .cse24 (mod (+ .cse25 .cse26 1) 4294967296)))) (.cse6 (exists ((v_prenex_432 Int)) (let ((.cse22 (select |c_#memory_int| |c_mapsum_#in~x.base|)) (.cse23 (+ |c_mapsum_#in~x.offset| 4))) (let ((.cse18 (select .cse22 .cse23)) (.cse19 (select .cse22 |c_mapsum_#in~x.offset|))) (let ((.cse17 (mod (let ((.cse20 (store (store .cse22 |c_mapsum_#in~x.offset| .cse18) .cse23 .cse19)) (.cse21 (* 4 v_prenex_432))) (+ (select .cse20 (+ .cse21 |c_mapsum_#in~x.offset| 4)) (select .cse20 (+ .cse21 |c_mapsum_#in~x.offset|)) (* 2 v_prenex_432) 1)) 4294967296))) (and (not (= .cse17 (mod (+ .cse18 .cse19 1) 4294967296))) (< (+ v_prenex_432 1) c_~N~0) (<= c_~N~0 (+ v_prenex_432 2)) (<= .cse17 2147483647)))))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse8) (or .cse0 .cse9 .cse6 .cse10) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse10) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse9 .cse6) (or .cse0 .cse1 .cse8 .cse6) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse5) (or .cse0 (forall ((v_mapsum_~i~0_81 Int)) (let ((.cse12 (mod c_mapsum_~ret~0 4294967296)) (.cse11 (mod (let ((.cse13 (let ((.cse16 (+ |c_mapsum_#in~x.offset| 4)) (.cse15 (select |c_#memory_int| |c_mapsum_#in~x.base|))) (store (store .cse15 |c_mapsum_#in~x.offset| (select .cse15 .cse16)) .cse16 (select .cse15 |c_mapsum_#in~x.offset|)))) (.cse14 (* 4 v_mapsum_~i~0_81))) (+ (* 2 v_mapsum_~i~0_81) (select .cse13 (+ .cse14 |c_mapsum_#in~x.offset| 4)) (select .cse13 (+ .cse14 |c_mapsum_#in~x.offset|)) 1)) 4294967296))) (or (< 2147483647 .cse11) (= (+ .cse11 4294967296) .cse12) (<= c_~N~0 (+ v_mapsum_~i~0_81 1)) (= .cse12 .cse11) (< (+ v_mapsum_~i~0_81 2) c_~N~0)))) .cse6)))))) is different from true [2019-10-06 23:03:07,894 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 188