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_copy2_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:25,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:25,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:25,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:25,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:25,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:25,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:25,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:25,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:25,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:25,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:25,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:25,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:25,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:25,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:25,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:25,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:25,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:25,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:25,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:25,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:25,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:25,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:25,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:25,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:25,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:25,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:25,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:25,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:25,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:25,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:25,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:25,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:25,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:25,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:25,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:25,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:25,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:25,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:25,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:25,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:25,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:25,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:25,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:25,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:25,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:25,652 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:25,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:25,656 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:25,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:25,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:25,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:25,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:25,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:25,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:25,657 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:25,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:25,657 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:25,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:25,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:25,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:25,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:25,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:25,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:25,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:25,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:25,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:25,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:25,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:25,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:25,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:33:25,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:25,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:25,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:25,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:25,966 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:25,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_ground-2.i [2019-10-13 21:33:26,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca0c4e69/c42c88efc9db4bf398073d7b400e5847/FLAG61c3e6b41 [2019-10-13 21:33:26,456 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:26,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_ground-2.i [2019-10-13 21:33:26,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca0c4e69/c42c88efc9db4bf398073d7b400e5847/FLAG61c3e6b41 [2019-10-13 21:33:26,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca0c4e69/c42c88efc9db4bf398073d7b400e5847 [2019-10-13 21:33:26,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:26,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:26,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:26,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:26,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:26,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409c6ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26, skipping insertion in model container [2019-10-13 21:33:26,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,914 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:26,934 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:27,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:27,194 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:27,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:27,249 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:27,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27 WrapperNode [2019-10-13 21:33:27,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:27,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:27,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:27,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:27,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... [2019-10-13 21:33:27,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:27,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:27,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:27,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:27,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:27,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:27,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:27,840 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:27,840 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:33:27,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:27 BoogieIcfgContainer [2019-10-13 21:33:27,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:27,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:27,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:27,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:27,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:26" (1/3) ... [2019-10-13 21:33:27,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cadb636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:27, skipping insertion in model container [2019-10-13 21:33:27,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:27" (2/3) ... [2019-10-13 21:33:27,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cadb636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:27, skipping insertion in model container [2019-10-13 21:33:27,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:27" (3/3) ... [2019-10-13 21:33:27,850 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy2_ground-2.i [2019-10-13 21:33:27,860 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:27,871 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:27,882 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:27,903 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:27,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:27,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:27,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:27,904 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:27,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:27,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:27,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:33:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:33:27,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:27,923 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:27,925 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1272573714, now seen corresponding path program 1 times [2019-10-13 21:33:27,938 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:27,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547050695] [2019-10-13 21:33:27,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:33:28,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547050695] [2019-10-13 21:33:28,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:28,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:28,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481142430] [2019-10-13 21:33:28,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:28,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:28,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:28,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:28,133 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-13 21:33:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:28,167 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-13 21:33:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:28,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:33:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:28,177 INFO L225 Difference]: With dead ends: 35 [2019-10-13 21:33:28,178 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:33:28,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:33:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:33:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:33:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-13 21:33:28,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-10-13 21:33:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:28,214 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-13 21:33:28,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-10-13 21:33:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:33:28,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:28,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:28,216 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:28,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1861910933, now seen corresponding path program 1 times [2019-10-13 21:33:28,217 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:28,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691048384] [2019-10-13 21:33:28,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:28,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691048384] [2019-10-13 21:33:28,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:28,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:28,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952024646] [2019-10-13 21:33:28,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:28,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:28,278 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 3 states. [2019-10-13 21:33:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:28,307 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-13 21:33:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:28,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:33:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:28,309 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:33:28,309 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:33:28,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:33:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:33:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:33:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-13 21:33:28,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-13 21:33:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:28,316 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-13 21:33:28,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-13 21:33:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:33:28,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:28,318 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:28,318 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:28,319 INFO L82 PathProgramCache]: Analyzing trace with hash 728822389, now seen corresponding path program 1 times [2019-10-13 21:33:28,319 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:28,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244856193] [2019-10-13 21:33:28,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:28,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:33:28,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244856193] [2019-10-13 21:33:28,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426681521] [2019-10-13 21:33:28,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:28,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:33:28,541 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:33:28,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1879327216] [2019-10-13 21:33:28,630 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:28,631 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:28,645 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:28,657 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:28,665 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:28,835 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:29,298 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:29,634 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:29,747 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:29,760 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:29,766 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:29,766 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:29,767 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:29,767 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~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-13 21:33:29,767 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:29,768 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:29,768 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,768 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,769 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,769 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:33:29,769 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(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-13 21:33:29,769 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:29,769 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:33:29,770 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:29,770 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem8|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem7|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:29,770 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~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-13 21:33:30,121 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:30,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:30,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553101338] [2019-10-13 21:33:30,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:30,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:30,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:30,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:30,125 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 18 states. [2019-10-13 21:33:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:30,765 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-13 21:33:30,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:30,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-10-13 21:33:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:30,768 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:33:30,768 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:33:30,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:33:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-13 21:33:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:33:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-13 21:33:30,785 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-10-13 21:33:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:30,785 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-13 21:33:30,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-13 21:33:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:33:30,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:30,788 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:30,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:30,989 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1554625518, now seen corresponding path program 2 times [2019-10-13 21:33:30,990 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:30,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702828916] [2019-10-13 21:33:30,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:30,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:30,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:33:31,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702828916] [2019-10-13 21:33:31,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111224357] [2019-10-13 21:33:31,065 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:31,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:31,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:31,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:31,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:33:31,151 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:33:31,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [520514709] [2019-10-13 21:33:31,191 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:31,192 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:31,193 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:31,193 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:31,194 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:31,231 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:31,840 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:31,859 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:31,869 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:31,869 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:31,870 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_6 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_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (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_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,870 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (exists ((v_prenex_6 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_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (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_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~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-13 21:33:31,871 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:31,871 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,871 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,871 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,872 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,872 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:33:31,872 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(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-13 21:33:31,872 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:31,873 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_6 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_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (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_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) [2019-10-13 21:33:31,876 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,876 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem8|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem7|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:31,876 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (exists ((v_prenex_6 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_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (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_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~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-13 21:33:32,233 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:32,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:32,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396554416] [2019-10-13 21:33:32,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:32,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:32,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:32,236 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 23 states. [2019-10-13 21:33:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:33,052 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-13 21:33:33,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:33:33,052 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-10-13 21:33:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:33,055 INFO L225 Difference]: With dead ends: 58 [2019-10-13 21:33:33,056 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:33:33,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 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-13 21:33:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:33:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-13 21:33:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:33:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-13 21:33:33,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2019-10-13 21:33:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:33,076 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-13 21:33:33,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-13 21:33:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:33:33,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:33,079 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:33,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:33,280 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:33,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:33,281 INFO L82 PathProgramCache]: Analyzing trace with hash -149803285, now seen corresponding path program 3 times [2019-10-13 21:33:33,281 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:33,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994235248] [2019-10-13 21:33:33,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:33,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:33:33,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994235248] [2019-10-13 21:33:33,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376783496] [2019-10-13 21:33:33,417 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:33,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:33,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:33,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:33,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:33:33,567 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:33:33,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [654963973] [2019-10-13 21:33:33,681 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:33,681 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:33,681 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:33,682 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:33,685 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:33,728 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:34,172 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:34,183 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:34,187 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:34,187 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:34,187 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 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_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,188 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 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_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,188 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:34,188 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,188 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:34,188 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:34,189 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:33:34,189 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:34,189 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(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-13 21:33:34,189 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:34,189 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 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_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:33:34,190 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,190 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem8|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem7|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:34,190 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 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_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:34,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-13 21:33:34,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067926300] [2019-10-13 21:33:34,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:34,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:34,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:34,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:34,545 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 31 states. [2019-10-13 21:33:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:35,785 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2019-10-13 21:33:35,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:33:35,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-10-13 21:33:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:35,786 INFO L225 Difference]: With dead ends: 75 [2019-10-13 21:33:35,787 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:33:35,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:33:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:33:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-13 21:33:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:33:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-13 21:33:35,798 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 30 [2019-10-13 21:33:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:35,799 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-13 21:33:35,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-13 21:33:35,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:33:35,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:35,800 INFO L380 BasicCegarLoop]: trace histogram [12, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:36,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:36,009 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1025373768, now seen corresponding path program 4 times [2019-10-13 21:33:36,011 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:36,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803192561] [2019-10-13 21:33:36,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:36,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-13 21:33:36,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803192561] [2019-10-13 21:33:36,200 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060110919] [2019-10-13 21:33:36,200 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:36,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:36,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:33:36,478 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:33:36,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1639710933] [2019-10-13 21:33:36,772 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:36,773 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:36,773 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:36,773 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:36,774 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:36,797 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:37,253 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:37,261 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:37,264 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:37,264 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:37,264 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~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|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,264 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~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|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,265 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:37,265 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,265 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:37,265 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:37,265 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:33:37,266 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:37,266 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(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-13 21:33:37,266 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:37,266 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~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|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) [2019-10-13 21:33:37,266 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,267 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem8|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem7|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:37,267 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~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|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,614 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:37,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 11] total 46 [2019-10-13 21:33:37,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586870247] [2019-10-13 21:33:37,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-13 21:33:37,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:37,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-13 21:33:37,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1619, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 21:33:37,618 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 46 states. [2019-10-13 21:33:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:39,433 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-10-13 21:33:39,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-13 21:33:39,434 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 39 [2019-10-13 21:33:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:39,435 INFO L225 Difference]: With dead ends: 93 [2019-10-13 21:33:39,436 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:33:39,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 92 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-13 21:33:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:33:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-10-13 21:33:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:33:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-10-13 21:33:39,449 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 39 [2019-10-13 21:33:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:39,449 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-10-13 21:33:39,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-13 21:33:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-10-13 21:33:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:33:39,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:39,451 INFO L380 BasicCegarLoop]: trace histogram [26, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:39,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:39,656 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash -738862322, now seen corresponding path program 5 times [2019-10-13 21:33:39,657 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:39,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154274087] [2019-10-13 21:33:39,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 21:33:40,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154274087] [2019-10-13 21:33:40,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390729615] [2019-10-13 21:33:40,203 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:40,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:40,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:40,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:33:40,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-13 21:33:40,779 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-10-13 21:33:41,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [724889992] [2019-10-13 21:33:41,052 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:41,053 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:41,053 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:41,053 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:41,054 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:41,091 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:41,507 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:41,513 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:41,517 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:41,517 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:41,517 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~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| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:41,517 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~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| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:41,518 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:41,518 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:41,518 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:41,518 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-13 21:33:41,518 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:41,518 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:33:41,519 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(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-13 21:33:41,519 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:41,519 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~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| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) [2019-10-13 21:33:41,519 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:41,519 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem8|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem7|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:41,520 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~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| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:42,023 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:42,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11, 11, 11] total 57 [2019-10-13 21:33:42,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243426886] [2019-10-13 21:33:42,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-13 21:33:42,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-13 21:33:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=2568, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:33:42,026 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 57 states. [2019-10-13 21:33:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:44,986 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2019-10-13 21:33:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-13 21:33:44,986 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 55 [2019-10-13 21:33:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:44,987 INFO L225 Difference]: With dead ends: 116 [2019-10-13 21:33:44,988 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 21:33:44,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2789 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1902, Invalid=9870, Unknown=0, NotChecked=0, Total=11772 [2019-10-13 21:33:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 21:33:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-10-13 21:33:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 21:33:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-10-13 21:33:45,003 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 55 [2019-10-13 21:33:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:45,004 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-10-13 21:33:45,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-13 21:33:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-10-13 21:33:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:33:45,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:45,007 INFO L380 BasicCegarLoop]: trace histogram [27, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:45,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:45,211 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:45,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1722620277, now seen corresponding path program 6 times [2019-10-13 21:33:45,212 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:45,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235993855] [2019-10-13 21:33:45,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:45,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-10-13 21:33:45,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235993855] [2019-10-13 21:33:45,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092300497] [2019-10-13 21:33:45,561 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:33:45,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:45,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:45,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:33:45,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:46,484 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:47,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1544238597] [2019-10-13 21:33:47,672 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:47,672 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:47,673 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:47,673 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:47,673 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:47,698 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:48,132 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:48,139 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:48,142 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:48,142 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:48,142 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| 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_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:48,143 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| 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_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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-13 21:33:48,143 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:48,143 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:48,143 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:48,143 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:48,143 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:48,143 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:33:48,144 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(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-13 21:33:48,144 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:48,144 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| 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_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:33:48,144 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:48,144 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem8|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem7|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:48,144 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| 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_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (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_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __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-13 21:33:48,673 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:48,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30, 30, 11] total 87 [2019-10-13 21:33:48,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029156325] [2019-10-13 21:33:48,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-10-13 21:33:48,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:48,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-10-13 21:33:48,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5591, Unknown=0, NotChecked=0, Total=7482 [2019-10-13 21:33:48,678 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 87 states. [2019-10-13 21:33:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:53,858 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2019-10-13 21:33:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-13 21:33:53,858 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 76 [2019-10-13 21:33:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:53,860 INFO L225 Difference]: With dead ends: 167 [2019-10-13 21:33:53,861 INFO L226 Difference]: Without dead ends: 120 [2019-10-13 21:33:53,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6686 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5705, Invalid=22687, Unknown=0, NotChecked=0, Total=28392 [2019-10-13 21:33:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-13 21:33:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-10-13 21:33:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-13 21:33:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2019-10-13 21:33:53,882 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 76 [2019-10-13 21:33:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:53,883 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2019-10-13 21:33:53,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-10-13 21:33:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2019-10-13 21:33:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:33:53,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:53,887 INFO L380 BasicCegarLoop]: trace histogram [56, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:54,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:54,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash 591761656, now seen corresponding path program 7 times [2019-10-13 21:33:54,092 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:54,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173658282] [2019-10-13 21:33:54,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:54,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:54,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2019-10-13 21:33:54,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173658282] [2019-10-13 21:33:54,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728018952] [2019-10-13 21:33:54,460 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:33:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:54,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:33:54,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-13 21:33:56,357 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-10-13 21:34:00,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [765927121] [2019-10-13 21:34:00,449 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:34:00,450 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:00,450 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:00,451 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:00,451 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:00,474 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:00,924 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:00,932 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:00,934 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:00,934 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:00,935 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 174#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~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| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:34:00,935 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 179#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~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| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __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-13 21:34:00,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 188#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:00,935 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:00,935 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:00,935 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:00,936 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 193#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:34:00,936 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:34:00,936 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 159#(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-13 21:34:00,936 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:00,936 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 169#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~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| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) [2019-10-13 21:34:00,937 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:00,937 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 164#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem8|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem7|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:34:00,937 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 184#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~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| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __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-13 21:34:01,594 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:01,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 59, 59, 11] total 146 [2019-10-13 21:34:01,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142992825] [2019-10-13 21:34:01,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-10-13 21:34:01,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-10-13 21:34:01,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6929, Invalid=14241, Unknown=0, NotChecked=0, Total=21170 [2019-10-13 21:34:01,599 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 146 states.