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_palindrome_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:35:41,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:35:41,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:35:41,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:35:41,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:35:41,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:35:41,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:35:41,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:35:41,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:35:41,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:35:41,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:35:41,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:35:41,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:35:41,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:35:41,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:35:41,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:35:41,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:35:41,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:35:41,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:35:41,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:35:41,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:35:41,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:35:41,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:35:41,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:35:41,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:35:41,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:35:41,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:35:41,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:35:41,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:35:41,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:35:41,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:35:41,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:35:41,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:35:41,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:35:41,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:35:41,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:35:41,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:35:41,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:35:41,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:35:41,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:35:41,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:35:41,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:35:41,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:35:41,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:35:41,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:35:41,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:35:41,487 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:35:41,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:35:41,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:35:41,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:35:41,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:35:41,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:35:41,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:35:41,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:35:41,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:35:41,492 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:35:41,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:35:41,492 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:35:41,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:35:41,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:35:41,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:35:41,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:35:41,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:35:41,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:41,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:35:41,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:35:41,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:35:41,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:35:41,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:35:41,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:35:41,494 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:35:41,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:35:41,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:35:41,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:35:41,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:35:41,827 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:35:41,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_palindrome_ground.i [2019-10-13 21:35:41,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883d3f5f/b85d2ae5748a4932a33c9257a5e96511/FLAGe930934a2 [2019-10-13 21:35:42,389 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:35:42,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_palindrome_ground.i [2019-10-13 21:35:42,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883d3f5f/b85d2ae5748a4932a33c9257a5e96511/FLAGe930934a2 [2019-10-13 21:35:42,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7883d3f5f/b85d2ae5748a4932a33c9257a5e96511 [2019-10-13 21:35:42,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:35:42,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:35:42,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:42,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:35:42,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:35:42,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:42" (1/1) ... [2019-10-13 21:35:42,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dea371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:42, skipping insertion in model container [2019-10-13 21:35:42,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:42" (1/1) ... [2019-10-13 21:35:42,827 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:35:42,852 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:35:43,079 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:43,085 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:35:43,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:43,124 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:35:43,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43 WrapperNode [2019-10-13 21:35:43,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:43,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:35:43,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:35:43,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:35:43,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (1/1) ... [2019-10-13 21:35:43,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (1/1) ... [2019-10-13 21:35:43,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (1/1) ... [2019-10-13 21:35:43,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (1/1) ... [2019-10-13 21:35:43,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (1/1) ... [2019-10-13 21:35:43,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (1/1) ... [2019-10-13 21:35:43,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (1/1) ... [2019-10-13 21:35:43,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:35:43,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:35:43,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:35:43,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:35:43,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (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:35:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:35:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:35:43,312 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:35:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:35:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:35:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:35:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:35:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:35:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:35:43,646 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:35:43,647 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:35:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:43 BoogieIcfgContainer [2019-10-13 21:35:43,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:35:43,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:35:43,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:35:43,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:35:43,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:35:42" (1/3) ... [2019-10-13 21:35:43,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6066472b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:43, skipping insertion in model container [2019-10-13 21:35:43,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:43" (2/3) ... [2019-10-13 21:35:43,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6066472b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:43, skipping insertion in model container [2019-10-13 21:35:43,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:43" (3/3) ... [2019-10-13 21:35:43,655 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_palindrome_ground.i [2019-10-13 21:35:43,665 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:35:43,676 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:35:43,687 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:35:43,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:35:43,708 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:35:43,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:35:43,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:35:43,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:35:43,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:35:43,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:35:43,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:35:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:35:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:35:43,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:43,728 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:43,730 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash -973561822, now seen corresponding path program 1 times [2019-10-13 21:35:43,742 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:43,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216444020] [2019-10-13 21:35:43,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:43,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:43,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:43,889 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:35:43,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216444020] [2019-10-13 21:35:43,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:43,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:43,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819468854] [2019-10-13 21:35:43,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:43,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:43,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:43,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:43,909 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:35:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:43,958 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-13 21:35:43,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:43,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:35:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:43,969 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:35:43,970 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:35:43,973 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:35:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:35:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:35:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:35:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:35:44,023 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-10-13 21:35:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:44,024 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:35:44,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:35:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:35:44,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:44,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:44,028 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1894348460, now seen corresponding path program 1 times [2019-10-13 21:35:44,030 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:44,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675203041] [2019-10-13 21:35:44,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:44,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:44,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:44,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675203041] [2019-10-13 21:35:44,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406719038] [2019-10-13 21:35:44,171 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:35:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:44,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:44,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:44,278 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:44,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [739116120] [2019-10-13 21:35:44,357 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:44,358 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:44,387 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:44,402 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:44,403 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:44,626 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:45,057 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:35:45,080 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:45,093 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:45,093 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:45,094 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:45,094 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 126#(and (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 399996)) (select (select |#memory_int| v_prenex_1) v_prenex_2)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) |v_main_~#A~0.offset_BEFORE_CALL_1|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:45,094 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 131#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 399996)) (select (select |#memory_int| v_prenex_1) v_prenex_2)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) |v_main_~#A~0.offset_BEFORE_CALL_1|))))) (<= 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:35:45,095 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 140#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:45,095 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 68#true [2019-10-13 21:35:45,095 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 116#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 (- 4)) |main_~#A~0.offset| 399996)) |main_#t~mem6|) (< main_~x~0 50000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 4) |main_~#A~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:45,096 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:35:45,096 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:35:45,097 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 145#(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:35:45,098 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:45,098 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 106#(<= 0 main_~i~0) [2019-10-13 21:35:45,098 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 121#(exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 399996)) (select (select |#memory_int| v_prenex_1) v_prenex_2)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) |v_main_~#A~0.offset_BEFORE_CALL_1|))))) [2019-10-13 21:35:45,100 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#A~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 399996)) (select (select |#memory_int| v_prenex_1) v_prenex_2)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) (+ |v_main_~#A~0.offset_BEFORE_CALL_1| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) |v_main_~#A~0.offset_BEFORE_CALL_1|))))) (<= 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:35:45,492 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:45,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:35:45,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436252157] [2019-10-13 21:35:45,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:35:45,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:35:45,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:35:45,503 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-13 21:35:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:46,110 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-10-13 21:35:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:35:46,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 21:35:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:46,120 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:35:46,120 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:35:46,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:35:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:35:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-13 21:35:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:35:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 21:35:46,147 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-13 21:35:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:46,147 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 21:35:46,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:35:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 21:35:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:35:46,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:46,148 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:46,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:46,354 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:46,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash -317151134, now seen corresponding path program 2 times [2019-10-13 21:35:46,355 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:46,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711790005] [2019-10-13 21:35:46,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:46,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:46,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:35:46,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711790005] [2019-10-13 21:35:46,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838987566] [2019-10-13 21:35:46,455 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:35:46,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:35:46,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:46,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:35:46,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:46,519 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:46,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891504252] [2019-10-13 21:35:46,560 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:46,562 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:46,562 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:46,562 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:46,563 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:46,616 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:46,867 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:35:46,885 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:46,891 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:46,891 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:46,892 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:46,892 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 126#(and (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) |v_main_~#A~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_3 399996)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:46,892 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 131#(and (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) |v_main_~#A~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_3 399996)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:46,892 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 140#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:46,893 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 68#true [2019-10-13 21:35:46,893 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 116#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 (- 4)) |main_~#A~0.offset| 399996)) |main_#t~mem6|) (< main_~x~0 50000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 4) |main_~#A~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:46,893 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:35:46,893 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:35:46,893 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 145#(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:35:46,894 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:46,894 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 106#(<= 0 main_~i~0) [2019-10-13 21:35:46,894 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 121#(exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) |v_main_~#A~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_3 399996)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-13 21:35:46,894 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 136#(and (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#A~0.offset_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) (+ |v_main_~#A~0.offset_BEFORE_CALL_2| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) |v_main_~#A~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_4) (+ v_prenex_3 399996)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:47,174 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:47,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 21 [2019-10-13 21:35:47,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079072171] [2019-10-13 21:35:47,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:35:47,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:35:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:35:47,179 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 21 states. [2019-10-13 21:35:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:47,949 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-10-13 21:35:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:35:47,950 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2019-10-13 21:35:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:47,951 INFO L225 Difference]: With dead ends: 53 [2019-10-13 21:35:47,951 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 21:35:47,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 21:35:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 21:35:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-10-13 21:35:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:35:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:35:47,961 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2019-10-13 21:35:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:47,962 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:35:47,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:35:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:35:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:35:47,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:47,963 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:48,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:48,167 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash -418739934, now seen corresponding path program 3 times [2019-10-13 21:35:48,168 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:48,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746131231] [2019-10-13 21:35:48,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:35:48,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746131231] [2019-10-13 21:35:48,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320450811] [2019-10-13 21:35:48,350 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:35:48,427 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:48,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:48,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:35:48,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:35:48,440 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:35:48,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1555922119] [2019-10-13 21:35:48,587 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:48,587 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:48,587 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:48,588 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:48,588 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:48,632 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:48,864 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:35:48,880 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:48,886 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:48,887 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:48,887 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:48,887 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 126#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 399996)) (select (select |#memory_int| v_prenex_5) v_prenex_6)))) (and (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:48,888 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 399996)) (select (select |#memory_int| v_prenex_5) v_prenex_6)))) (and (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|)) (= |__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:35:48,888 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 140#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:48,888 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 68#true [2019-10-13 21:35:48,889 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 116#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 (- 4)) |main_~#A~0.offset| 399996)) |main_#t~mem6|) (< main_~x~0 50000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 4) |main_~#A~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:48,889 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:35:48,889 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:35:48,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 145#(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:35:48,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:48,890 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 106#(<= 0 main_~i~0) [2019-10-13 21:35:48,891 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 136#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 399996)) (select (select |#memory_int| v_prenex_5) v_prenex_6)))) (and (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|)) (= |__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:35:48,891 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 121#(exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 399996)) (select (select |#memory_int| v_prenex_5) v_prenex_6)))) (and (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) (+ |v_main_~#A~0.offset_BEFORE_CALL_3| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) |v_main_~#A~0.offset_BEFORE_CALL_3|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:35:49,220 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:49,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 31 [2019-10-13 21:35:49,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499775966] [2019-10-13 21:35:49,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:35:49,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:35:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:35:49,225 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 31 states. [2019-10-13 21:35:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:50,418 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-10-13 21:35:50,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 21:35:50,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 28 [2019-10-13 21:35:50,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:50,421 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:35:50,421 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:35:50,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=2335, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 21:35:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:35:50,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-13 21:35:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:35:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-13 21:35:50,434 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 28 [2019-10-13 21:35:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:50,434 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-13 21:35:50,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:35:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-13 21:35:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:35:50,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:50,436 INFO L380 BasicCegarLoop]: trace histogram [18, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:50,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:50,641 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash 798654980, now seen corresponding path program 4 times [2019-10-13 21:35:50,642 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:50,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460687364] [2019-10-13 21:35:50,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:50,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:50,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-13 21:35:50,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460687364] [2019-10-13 21:35:50,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175101511] [2019-10-13 21:35:50,935 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:35:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:51,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-13 21:35:51,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-13 21:35:51,045 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-13 21:35:51,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [863795880] [2019-10-13 21:35:51,555 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:51,556 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:51,556 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:51,556 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:51,557 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:51,591 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:51,729 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:35:51,738 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:51,742 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:51,743 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:51,743 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:51,743 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 126#(and (exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 399996)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:51,743 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 131#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 399996)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:51,744 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 140#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:51,744 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 68#true [2019-10-13 21:35:51,744 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 116#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 (- 4)) |main_~#A~0.offset| 399996)) |main_#t~mem6|) (< main_~x~0 50000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 4) |main_~#A~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:51,744 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:35:51,744 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:35:51,745 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 145#(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:35:51,745 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:51,745 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 106#(<= 0 main_~i~0) [2019-10-13 21:35:51,745 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 399996)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:51,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 121#(exists ((v_prenex_7 Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) (+ |v_main_~#A~0.offset_BEFORE_CALL_4| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) |v_main_~#A~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_7) (+ v_prenex_8 399996)) (select (select |#memory_int| v_prenex_7) v_prenex_8)))))) [2019-10-13 21:35:52,098 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:52,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21, 11] total 51 [2019-10-13 21:35:52,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31354465] [2019-10-13 21:35:52,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-13 21:35:52,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:52,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-13 21:35:52,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=850, Invalid=1700, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 21:35:52,102 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 51 states. [2019-10-13 21:35:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:54,790 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2019-10-13 21:35:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-13 21:35:54,790 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 39 [2019-10-13 21:35:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:54,792 INFO L225 Difference]: With dead ends: 101 [2019-10-13 21:35:54,792 INFO L226 Difference]: Without dead ends: 82 [2019-10-13 21:35:54,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2615, Invalid=6505, Unknown=0, NotChecked=0, Total=9120 [2019-10-13 21:35:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-13 21:35:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2019-10-13 21:35:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 21:35:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-10-13 21:35:54,822 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 39 [2019-10-13 21:35:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:54,822 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-10-13 21:35:54,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-13 21:35:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-10-13 21:35:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 21:35:54,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:54,827 INFO L380 BasicCegarLoop]: trace histogram [38, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:55,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:55,036 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1517035324, now seen corresponding path program 5 times [2019-10-13 21:35:55,037 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:55,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168973795] [2019-10-13 21:35:55,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-13 21:35:55,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168973795] [2019-10-13 21:35:55,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104896923] [2019-10-13 21:35:55,955 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:36:08,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-13 21:36:08,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:08,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 21:36:08,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-13 21:36:08,907 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-13 21:36:09,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881326098] [2019-10-13 21:36:09,699 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:09,700 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:09,700 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:09,700 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:09,700 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:09,724 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:09,873 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:36:09,881 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:09,886 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:09,887 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:09,887 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:09,887 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 126#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 399996)) (select (select |#memory_int| v_prenex_9) v_prenex_10))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:09,888 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 131#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 399996)) (select (select |#memory_int| v_prenex_9) v_prenex_10))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (<= __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:36:09,888 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 140#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:09,888 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 68#true [2019-10-13 21:36:09,890 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 116#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 (- 4)) |main_~#A~0.offset| 399996)) |main_#t~mem6|) (< main_~x~0 50000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 4) |main_~#A~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:09,890 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:36:09,890 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:36:09,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 145#(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:36:09,891 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:09,892 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 106#(<= 0 main_~i~0) [2019-10-13 21:36:09,894 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 136#(and (exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 399996)) (select (select |#memory_int| v_prenex_9) v_prenex_10))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) (<= __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:36:09,894 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 121#(exists ((|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (|v_main_~#A~0.offset_BEFORE_CALL_5| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 399996)) (select (select |#memory_int| v_prenex_9) v_prenex_10))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) (+ |v_main_~#A~0.offset_BEFORE_CALL_5| 399996)) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) |v_main_~#A~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:36:10,336 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:10,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22, 22, 11] total 72 [2019-10-13 21:36:10,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493931621] [2019-10-13 21:36:10,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-13 21:36:10,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-13 21:36:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1921, Invalid=3191, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:36:10,341 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 72 states. [2019-10-13 21:36:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:14,894 INFO L93 Difference]: Finished difference Result 172 states and 236 transitions. [2019-10-13 21:36:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-13 21:36:14,894 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 69 [2019-10-13 21:36:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:14,897 INFO L225 Difference]: With dead ends: 172 [2019-10-13 21:36:14,897 INFO L226 Difference]: Without dead ends: 143 [2019-10-13 21:36:14,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3619 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5752, Invalid=13154, Unknown=0, NotChecked=0, Total=18906 [2019-10-13 21:36:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-13 21:36:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2019-10-13 21:36:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-13 21:36:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-10-13 21:36:14,920 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 69 [2019-10-13 21:36:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:14,920 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-10-13 21:36:14,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-13 21:36:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-10-13 21:36:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:36:14,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:14,923 INFO L380 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:15,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:15,126 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1462323180, now seen corresponding path program 6 times [2019-10-13 21:36:15,127 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:15,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577187804] [2019-10-13 21:36:15,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:15,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:15,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-13 21:36:16,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577187804] [2019-10-13 21:36:16,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685389217] [2019-10-13 21:36:16,766 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:36:16,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:16,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:16,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-13 21:36:16,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-13 21:36:16,981 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-13 21:36:20,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1249971385] [2019-10-13 21:36:20,803 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:20,803 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:20,804 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:20,804 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:20,804 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:20,831 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:20,957 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:36:20,968 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:20,972 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:20,972 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:20,973 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 111#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:20,973 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 126#(and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 399996)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 399996))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:20,973 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 131#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 399996)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 399996))))))) (<= 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:36:20,973 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 140#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:20,973 INFO L193 IcfgInterpreter]: Reachable states at location L7-3 satisfy 68#true [2019-10-13 21:36:20,974 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 116#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 (- 4)) |main_~#A~0.offset| 399996)) |main_#t~mem6|) (< main_~x~0 50000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 50000 main_~i~0) (not (< main_~i~0 50000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#A~0.base|) (+ (* main_~x~0 4) |main_~#A~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:20,974 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:36:20,974 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:36:20,974 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 145#(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:36:20,974 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:20,975 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 106#(<= 0 main_~i~0) [2019-10-13 21:36:20,975 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 399996)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 399996))))))) (<= 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:36:20,975 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 121#(exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#A~0.offset_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) v_prenex_11) (select (select |#memory_int| v_prenex_12) (+ v_prenex_11 399996)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) |v_main_~#A~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) (+ |v_main_~#A~0.offset_BEFORE_CALL_6| 399996))))))) [2019-10-13 21:36:21,548 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:21,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62, 11] total 133 [2019-10-13 21:36:21,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236764132] [2019-10-13 21:36:21,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-10-13 21:36:21,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:21,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-10-13 21:36:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7533, Invalid=10023, Unknown=0, NotChecked=0, Total=17556 [2019-10-13 21:36:21,556 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 133 states.