java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_copy4_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:31:23,397 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:31:23,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:31:23,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:31:23,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:31:23,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:31:23,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:31:23,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:31:23,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:31:23,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:31:23,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:31:23,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:31:23,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:31:23,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:31:23,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:31:23,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:31:23,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:31:23,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:31:23,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:31:23,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:31:23,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:31:23,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:31:23,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:31:23,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:31:23,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:31:23,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:31:23,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:31:23,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:31:23,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:31:23,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:31:23,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:31:23,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:31:23,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:31:23,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:31:23,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:31:23,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:31:23,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:31:23,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:31:23,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:31:23,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:31:23,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:31:23,446 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:31:23,460 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:31:23,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:31:23,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:31:23,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:31:23,462 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:31:23,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:31:23,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:31:23,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:31:23,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:31:23,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:31:23,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:31:23,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:31:23,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:31:23,464 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:31:23,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:31:23,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:31:23,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:31:23,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:31:23,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:31:23,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:31:23,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:31:23,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:31:23,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:31:23,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:31:23,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:31:23,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:31:23,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:31:23,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:31:23,467 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:31:23,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:31:23,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:31:23,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:31:23,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:31:23,757 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:31:23,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_ground-2.i [2019-10-06 23:31:23,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87228c05e/02c12a81c1c84dfb8e624b6423376447/FLAG87f1c13e3 [2019-10-06 23:31:24,247 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:31:24,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_ground-2.i [2019-10-06 23:31:24,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87228c05e/02c12a81c1c84dfb8e624b6423376447/FLAG87f1c13e3 [2019-10-06 23:31:24,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87228c05e/02c12a81c1c84dfb8e624b6423376447 [2019-10-06 23:31:24,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:31:24,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:31:24,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:24,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:31:24,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:31:24,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:24,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24, skipping insertion in model container [2019-10-06 23:31:24,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:24,696 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:31:24,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:31:24,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:24,934 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:31:24,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:24,982 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:31:24,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24 WrapperNode [2019-10-06 23:31:24,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:24,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:31:24,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:31:24,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:31:25,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:25,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:25,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:25,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:25,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:25,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:25,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... [2019-10-06 23:31:25,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:31:25,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:31:25,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:31:25,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:31:25,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:31:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:31:25,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:31:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:31:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:31:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:31:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:31:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:31:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:31:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:31:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:31:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:31:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:31:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:31:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:31:25,579 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:31:25,579 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-06 23:31:25,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:25 BoogieIcfgContainer [2019-10-06 23:31:25,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:31:25,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:31:25,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:31:25,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:31:25,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:31:24" (1/3) ... [2019-10-06 23:31:25,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edfcdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:25, skipping insertion in model container [2019-10-06 23:31:25,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:24" (2/3) ... [2019-10-06 23:31:25,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edfcdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:25, skipping insertion in model container [2019-10-06 23:31:25,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:25" (3/3) ... [2019-10-06 23:31:25,588 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy4_ground-2.i [2019-10-06 23:31:25,597 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:31:25,605 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:31:25,616 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:31:25,639 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:31:25,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:31:25,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:31:25,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:31:25,639 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:31:25,639 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:31:25,639 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:31:25,639 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:31:25,653 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-06 23:31:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:31:25,658 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:25,658 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:25,660 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1907873763, now seen corresponding path program 1 times [2019-10-06 23:31:25,671 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:25,671 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:25,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:25,671 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:31:25,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:25,840 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:25,840 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:25,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:25,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:25,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:25,857 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-06 23:31:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:25,895 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2019-10-06 23:31:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:25,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-06 23:31:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:25,910 INFO L225 Difference]: With dead ends: 39 [2019-10-06 23:31:25,911 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:31:25,916 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:31:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:31:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:31:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:31:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-06 23:31:25,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2019-10-06 23:31:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:25,966 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-06 23:31:25,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-10-06 23:31:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:31:25,969 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:25,970 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:25,970 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash 309375907, now seen corresponding path program 1 times [2019-10-06 23:31:25,972 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:25,972 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:25,973 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:25,973 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:31:26,077 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:26,078 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:26,078 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:26,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:26,083 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 3 states. [2019-10-06 23:31:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:26,120 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-10-06 23:31:26,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:26,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:31:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:26,122 INFO L225 Difference]: With dead ends: 36 [2019-10-06 23:31:26,122 INFO L226 Difference]: Without dead ends: 24 [2019-10-06 23:31:26,123 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:31:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-06 23:31:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-06 23:31:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:31:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-06 23:31:26,130 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2019-10-06 23:31:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:26,131 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-06 23:31:26,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-06 23:31:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:31:26,132 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:26,132 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:26,133 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1949160451, now seen corresponding path program 1 times [2019-10-06 23:31:26,134 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:26,134 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:26,134 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:26,134 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:31:26,226 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:26,227 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:26,227 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:31:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:26,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:31:26,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:31:26,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:31:26,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:26,421 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:26,421 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:26,429 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:26,437 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:26,438 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:26,590 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:27,141 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:31:27,883 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:31:28,005 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:28,027 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:28,034 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:28,035 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:28,035 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:28,036 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:28,036 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:28,037 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:28,037 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:28,038 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:28,038 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:28,038 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:28,039 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:28,039 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:28,040 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:28,040 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:28,040 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-06 23:31:28,041 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:28,041 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) [2019-10-06 23:31:28,041 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 0 main_~x~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:31:28,381 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:28,381 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:31:28,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:31:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:31:28,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:31:28,386 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 18 states. [2019-10-06 23:31:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:29,087 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2019-10-06 23:31:29,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:31:29,087 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-10-06 23:31:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:29,089 INFO L225 Difference]: With dead ends: 57 [2019-10-06 23:31:29,089 INFO L226 Difference]: Without dead ends: 40 [2019-10-06 23:31:29,090 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:31:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-06 23:31:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-10-06 23:31:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-06 23:31:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-06 23:31:29,099 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2019-10-06 23:31:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:29,099 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-06 23:31:29,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:31:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-06 23:31:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:31:29,100 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:29,101 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:29,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:29,306 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash -519859613, now seen corresponding path program 2 times [2019-10-06 23:31:29,307 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:29,308 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:29,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:29,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:31:29,445 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:29,445 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:29,445 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 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:31:29,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:31:29,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:29,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:31:29,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-06 23:31:29,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-06 23:31:29,601 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:29,602 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:29,602 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:29,603 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:29,603 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:29,603 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:29,638 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:30,676 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:30,687 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:30,690 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:30,690 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:30,690 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:30,691 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:30,691 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:30,691 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:30,691 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:30,692 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:30,692 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:30,692 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:30,693 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:30,693 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:30,693 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:30,694 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:30,695 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-06 23:31:30,695 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:30,695 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) [2019-10-06 23:31:30,695 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 0 main_~x~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:31:30,996 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:30,996 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-06 23:31:30,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:31:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:31:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:31:30,998 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 23 states. [2019-10-06 23:31:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:31,980 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-10-06 23:31:31,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:31:31,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-10-06 23:31:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:31,982 INFO L225 Difference]: With dead ends: 78 [2019-10-06 23:31:31,982 INFO L226 Difference]: Without dead ends: 57 [2019-10-06 23:31:31,983 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:31:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-06 23:31:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-06 23:31:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-06 23:31:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-06 23:31:31,994 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2019-10-06 23:31:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:31,994 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-06 23:31:31,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:31:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-06 23:31:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-06 23:31:31,996 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:31,996 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:32,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:32,201 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:32,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:32,201 INFO L82 PathProgramCache]: Analyzing trace with hash -122686685, now seen corresponding path program 3 times [2019-10-06 23:31:32,202 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:32,202 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:32,202 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:32,203 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:32,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-06 23:31:32,390 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:32,390 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:32,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31:32,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:32,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:32,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:31:32,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:32,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:32,648 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:32,650 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:32,650 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:32,651 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:32,651 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:32,651 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:32,681 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:33,558 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:33,564 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:33,567 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:33,567 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:33,568 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:33,568 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:33,568 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:33,568 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:33,568 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:33,569 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:33,569 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:33,569 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:33,569 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:33,570 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:33,570 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:33,570 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:33,570 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-06 23:31:33,570 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:33,570 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) [2019-10-06 23:31:33,571 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 0 main_~x~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:31:33,876 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:33,876 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-06 23:31:33,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-06 23:31:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-06 23:31:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:31:33,881 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 31 states. [2019-10-06 23:31:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:35,156 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2019-10-06 23:31:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-06 23:31:35,165 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-10-06 23:31:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:35,166 INFO L225 Difference]: With dead ends: 105 [2019-10-06 23:31:35,166 INFO L226 Difference]: Without dead ends: 68 [2019-10-06 23:31:35,169 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-06 23:31:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-06 23:31:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-10-06 23:31:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-06 23:31:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2019-10-06 23:31:35,180 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 44 [2019-10-06 23:31:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:35,180 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2019-10-06 23:31:35,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-06 23:31:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2019-10-06 23:31:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-06 23:31:35,182 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:35,182 INFO L385 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:35,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:35,386 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:35,387 INFO L82 PathProgramCache]: Analyzing trace with hash 444261821, now seen corresponding path program 4 times [2019-10-06 23:31:35,387 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:35,388 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:35,388 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:35,388 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:35,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-06 23:31:35,569 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:35,569 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:35,569 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:35,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:31:35,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-06 23:31:35,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-06 23:31:36,076 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:36,078 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:36,078 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:36,078 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:36,079 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:36,079 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:36,102 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:37,010 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:37,016 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:37,019 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:37,019 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:37,019 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:37,020 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:37,020 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:37,020 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:37,020 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:37,020 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:37,021 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:37,021 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:37,021 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:37,021 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:37,021 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:37,022 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:37,022 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-06 23:31:37,022 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:37,022 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:31:37,022 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 0 main_~x~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:31:37,369 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:37,370 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 11] total 46 [2019-10-06 23:31:37,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-06 23:31:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-06 23:31:37,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1619, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:31:37,373 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 46 states. [2019-10-06 23:31:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:39,329 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2019-10-06 23:31:39,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-06 23:31:39,330 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2019-10-06 23:31:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:39,332 INFO L225 Difference]: With dead ends: 127 [2019-10-06 23:31:39,332 INFO L226 Difference]: Without dead ends: 86 [2019-10-06 23:31:39,335 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1363, Invalid=6119, Unknown=0, NotChecked=0, Total=7482 [2019-10-06 23:31:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-06 23:31:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-10-06 23:31:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-06 23:31:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-06 23:31:39,349 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 55 [2019-10-06 23:31:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:39,349 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-06 23:31:39,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-06 23:31:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-06 23:31:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-06 23:31:39,351 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:39,351 INFO L385 BasicCegarLoop]: trace histogram [26, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:39,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:39,555 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:39,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:39,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1175045661, now seen corresponding path program 5 times [2019-10-06 23:31:39,556 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:39,556 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:39,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:39,556 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-06 23:31:39,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:39,941 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:39,941 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:42,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:31:42,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:42,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:31:42,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-06 23:31:42,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-06 23:31:42,356 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:42,358 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:42,358 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:42,359 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:42,359 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:42,359 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:42,373 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:43,154 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:43,164 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:43,167 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:43,167 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:43,167 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:43,168 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:43,168 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:43,168 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:43,168 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:43,168 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:43,169 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:43,169 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:43,169 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:43,169 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:31:43,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:43,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:43,170 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-06 23:31:43,170 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:43,170 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) [2019-10-06 23:31:43,170 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 0 main_~x~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:31:43,490 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:43,490 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 31 [2019-10-06 23:31:43,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-06 23:31:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-06 23:31:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:31:43,493 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 31 states. [2019-10-06 23:31:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:44,884 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2019-10-06 23:31:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-06 23:31:44,885 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2019-10-06 23:31:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:44,887 INFO L225 Difference]: With dead ends: 162 [2019-10-06 23:31:44,887 INFO L226 Difference]: Without dead ends: 126 [2019-10-06 23:31:44,888 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2019-10-06 23:31:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-06 23:31:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-10-06 23:31:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-06 23:31:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2019-10-06 23:31:44,904 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 73 [2019-10-06 23:31:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:44,905 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2019-10-06 23:31:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-06 23:31:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2019-10-06 23:31:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-06 23:31:44,907 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:44,907 INFO L385 BasicCegarLoop]: trace histogram [26, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:45,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:45,108 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1972973981, now seen corresponding path program 6 times [2019-10-06 23:31:45,109 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:45,109 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:45,109 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:45,109 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-06 23:31:45,691 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:45,692 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:45,692 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:45,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:45,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:45,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-06 23:31:45,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-06 23:31:46,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-06 23:31:48,117 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:48,118 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:48,118 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:48,119 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:48,119 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:48,119 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:48,134 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:48,981 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:48,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:48,987 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:48,988 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:48,988 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:48,988 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,988 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:48,988 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:48,988 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,988 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:48,989 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:48,989 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,989 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:48,989 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:48,989 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:48,989 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:48,990 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-06 23:31:48,990 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:48,990 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) [2019-10-06 23:31:48,991 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 0 main_~x~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:31:49,530 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:49,530 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 29, 11] total 85 [2019-10-06 23:31:49,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-06 23:31:49,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-06 23:31:49,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1778, Invalid=5362, Unknown=0, NotChecked=0, Total=7140 [2019-10-06 23:31:49,535 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 85 states. [2019-10-06 23:31:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:54,497 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2019-10-06 23:31:54,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-06 23:31:54,497 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 113 [2019-10-06 23:31:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:54,499 INFO L225 Difference]: With dead ends: 243 [2019-10-06 23:31:54,499 INFO L226 Difference]: Without dead ends: 158 [2019-10-06 23:31:54,508 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6399 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5366, Invalid=21694, Unknown=0, NotChecked=0, Total=27060 [2019-10-06 23:31:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-06 23:31:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2019-10-06 23:31:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-06 23:31:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 154 transitions. [2019-10-06 23:31:54,527 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 154 transitions. Word has length 113 [2019-10-06 23:31:54,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:54,528 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 154 transitions. [2019-10-06 23:31:54,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-06 23:31:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 154 transitions. [2019-10-06 23:31:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-06 23:31:54,531 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:54,531 INFO L385 BasicCegarLoop]: trace histogram [54, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:54,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:54,736 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:54,736 INFO L82 PathProgramCache]: Analyzing trace with hash -95848259, now seen corresponding path program 7 times [2019-10-06 23:31:54,737 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:54,737 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:54,737 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:54,737 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:54,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2055 trivial. 0 not checked. [2019-10-06 23:31:55,388 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:55,388 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:55,388 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:55,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-06 23:31:55,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-06 23:31:57,311 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:32:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-06 23:32:01,002 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:32:01,003 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:32:01,003 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:32:01,004 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:32:01,004 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:32:01,004 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:32:01,019 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:32:01,851 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:32:01,861 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:32:01,863 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:32:01,864 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:32:01,864 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 264#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-06 23:32:01,864 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,864 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 269#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-06 23:32:01,864 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 278#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:32:01,865 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,865 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 274#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-06 23:32:01,865 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 249#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:01,865 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,865 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:32:01,866 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:32:01,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 283#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:32:01,866 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:32:01,866 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 72#true [2019-10-06 23:32:01,866 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:01,867 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 259#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) [2019-10-06 23:32:01,867 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 254#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem13| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 0 main_~x~0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)))) [2019-10-06 23:32:02,523 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:32:02,523 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 57, 57, 11] total 142 [2019-10-06 23:32:02,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-10-06 23:32:02,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-10-06 23:32:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6475, Invalid=13547, Unknown=0, NotChecked=0, Total=20022 [2019-10-06 23:32:02,529 INFO L87 Difference]: Start difference. First operand 149 states and 154 transitions. Second operand 142 states. [2019-10-06 23:32:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:32:14,332 INFO L93 Difference]: Finished difference Result 307 states and 376 transitions. [2019-10-06 23:32:14,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-10-06 23:32:14,332 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 145 [2019-10-06 23:32:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:32:14,334 INFO L225 Difference]: With dead ends: 307 [2019-10-06 23:32:14,334 INFO L226 Difference]: Without dead ends: 218 [2019-10-06 23:32:14,340 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16638 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=19459, Invalid=58103, Unknown=0, NotChecked=0, Total=77562 [2019-10-06 23:32:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-06 23:32:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 209. [2019-10-06 23:32:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-06 23:32:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 214 transitions. [2019-10-06 23:32:14,359 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 214 transitions. Word has length 145 [2019-10-06 23:32:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:32:14,360 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 214 transitions. [2019-10-06 23:32:14,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-10-06 23:32:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 214 transitions. [2019-10-06 23:32:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-06 23:32:14,363 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:32:14,364 INFO L385 BasicCegarLoop]: trace histogram [110, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:32:14,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:14,569 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:32:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:32:14,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1737259235, now seen corresponding path program 8 times [2019-10-06 23:32:14,570 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:32:14,570 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:14,570 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:14,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:32:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6945 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 6735 trivial. 0 not checked. [2019-10-06 23:32:16,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:16,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:32:16,524 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true