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_copy1_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:05,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:05,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:05,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:05,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:05,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:05,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:05,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:05,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:05,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:05,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:05,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:05,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:05,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:05,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:05,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:05,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:05,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:05,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:05,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:05,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:05,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:05,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:05,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:05,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:05,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:05,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:05,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:05,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:05,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:05,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:05,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:05,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:05,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:05,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:05,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:05,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:05,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:05,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:05,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:05,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:05,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:05,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:05,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:05,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:05,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:05,152 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:05,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:05,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:05,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:05,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:05,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:05,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:05,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:05,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:05,154 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:05,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:05,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:05,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:05,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:05,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:05,155 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:05,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:05,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:05,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:05,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:05,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:05,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:05,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:05,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:05,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:33:05,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:05,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:05,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:05,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:05,438 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:05,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-10-13 21:33:05,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6040020/f3c82a1288734e508e9f686a01c526cf/FLAG8cb9af5f5 [2019-10-13 21:33:05,990 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:05,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_ground-2.i [2019-10-13 21:33:05,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6040020/f3c82a1288734e508e9f686a01c526cf/FLAG8cb9af5f5 [2019-10-13 21:33:06,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6040020/f3c82a1288734e508e9f686a01c526cf [2019-10-13 21:33:06,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:06,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:06,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:06,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:06,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:06,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d641b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06, skipping insertion in model container [2019-10-13 21:33:06,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:06,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:06,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:06,598 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:06,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:06,641 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:06,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06 WrapperNode [2019-10-13 21:33:06,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:06,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:06,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:06,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:06,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... [2019-10-13 21:33:06,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:06,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:06,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:06,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:06,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:06,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:06,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:06,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:07,217 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:07,218 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:33:07,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:07 BoogieIcfgContainer [2019-10-13 21:33:07,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:07,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:07,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:07,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:07,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:06" (1/3) ... [2019-10-13 21:33:07,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceb9b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:07, skipping insertion in model container [2019-10-13 21:33:07,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:06" (2/3) ... [2019-10-13 21:33:07,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ceb9b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:07, skipping insertion in model container [2019-10-13 21:33:07,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:07" (3/3) ... [2019-10-13 21:33:07,228 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy1_ground-2.i [2019-10-13 21:33:07,238 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:07,246 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:07,257 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:07,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:07,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:07,283 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:07,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:07,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:07,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:07,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:07,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:33:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:33:07,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:07,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:07,312 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:07,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1524454115, now seen corresponding path program 1 times [2019-10-13 21:33:07,329 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:07,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562370373] [2019-10-13 21:33:07,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:33:07,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562370373] [2019-10-13 21:33:07,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:07,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:07,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844435543] [2019-10-13 21:33:07,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:07,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:07,514 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:33:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:07,554 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:33:07,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:07,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:33:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:07,565 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:33:07,565 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:33:07,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:33:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:33:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:33:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:33:07,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:33:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:07,610 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:33:07,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:33:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:33:07,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:07,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:07,612 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -32570220, now seen corresponding path program 1 times [2019-10-13 21:33:07,613 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:07,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624668162] [2019-10-13 21:33:07,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:07,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624668162] [2019-10-13 21:33:07,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:07,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:07,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690071516] [2019-10-13 21:33:07,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:07,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:07,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:07,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:07,680 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:33:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:07,696 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-13 21:33:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:07,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:33:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:07,698 INFO L225 Difference]: With dead ends: 27 [2019-10-13 21:33:07,699 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:33:07,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:33:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:33:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:33:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:33:07,706 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:33:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:07,706 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:33:07,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:33:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:33:07,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:07,708 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:07,708 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:07,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1459604560, now seen corresponding path program 1 times [2019-10-13 21:33:07,709 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:07,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567638365] [2019-10-13 21:33:07,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:07,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:07,787 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:33:07,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567638365] [2019-10-13 21:33:07,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437688533] [2019-10-13 21:33:07,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:07,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:07,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:07,913 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:33:07,914 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:07,951 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:33:07,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639125591] [2019-10-13 21:33:07,976 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:07,977 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:07,983 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:07,992 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:07,992 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:08,189 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:08,634 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:08,658 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:08,670 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:08,671 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:08,671 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:08,671 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~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:33:08,672 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:08,672 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:08,672 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:08,673 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:08,674 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:08,674 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:08,675 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:08,675 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:08,675 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:08,676 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:08,676 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~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:33:09,048 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:09,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:09,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932498604] [2019-10-13 21:33:09,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:09,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:09,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:09,056 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-13 21:33:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:09,794 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-10-13 21:33:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:09,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-13 21:33:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:09,796 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:33:09,796 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:33:09,797 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:33:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-13 21:33:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:33:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 21:33:09,805 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-13 21:33:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:09,806 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 21:33:09,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 21:33:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:09,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:09,807 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:10,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:10,019 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:10,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:10,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2046081309, now seen corresponding path program 2 times [2019-10-13 21:33:10,020 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:10,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940938406] [2019-10-13 21:33:10,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:10,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:10,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:10,118 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:33:10,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940938406] [2019-10-13 21:33:10,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915534580] [2019-10-13 21:33:10,119 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:10,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:10,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:10,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:10,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:10,198 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:33:10,198 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:10,226 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:33:10,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1618840562] [2019-10-13 21:33:10,228 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:10,228 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:10,229 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:10,229 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:10,229 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:10,270 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:10,535 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:10,545 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:10,550 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:10,550 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:10,551 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:10,551 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:10,551 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:10,551 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:10,552 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:10,552 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:10,552 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:10,552 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:10,553 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:10,553 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:10,553 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) [2019-10-13 21:33:10,553 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:10,554 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:10,889 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:10,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:10,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460456384] [2019-10-13 21:33:10,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:10,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:10,892 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2019-10-13 21:33:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:11,447 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-10-13 21:33:11,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:11,448 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-10-13 21:33:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:11,450 INFO L225 Difference]: With dead ends: 44 [2019-10-13 21:33:11,450 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 21:33:11,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 21:33:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-10-13 21:33:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:33:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-10-13 21:33:11,458 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2019-10-13 21:33:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:11,458 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-10-13 21:33:11,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-10-13 21:33:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:33:11,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:11,460 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:11,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:11,667 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:11,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash -398092701, now seen corresponding path program 3 times [2019-10-13 21:33:11,668 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:11,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124690594] [2019-10-13 21:33:11,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:11,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:11,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:33:11,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124690594] [2019-10-13 21:33:11,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512968213] [2019-10-13 21:33:11,809 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:11,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:11,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:11,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:11,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:33:11,941 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:33:12,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1928923997] [2019-10-13 21:33:12,035 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:12,036 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:12,036 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:12,037 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:12,037 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:12,090 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:12,281 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:12,296 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:12,302 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:12,303 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:12,303 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:12,303 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:12,303 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:12,304 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:12,304 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:12,304 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:12,304 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:12,304 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:12,305 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:12,305 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:12,305 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) [2019-10-13 21:33:12,307 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:12,308 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:12,685 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:12,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-13 21:33:12,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152744262] [2019-10-13 21:33:12,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:33:12,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:12,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:33:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:33:12,688 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 29 states. [2019-10-13 21:33:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:13,699 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-10-13 21:33:13,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 21:33:13,700 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 22 [2019-10-13 21:33:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:13,701 INFO L225 Difference]: With dead ends: 58 [2019-10-13 21:33:13,701 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:33:13,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:33:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-10-13 21:33:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:33:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-13 21:33:13,712 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-10-13 21:33:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:13,713 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-13 21:33:13,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:33:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-13 21:33:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:33:13,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:13,714 INFO L380 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:13,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:13,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1654238721, now seen corresponding path program 4 times [2019-10-13 21:33:13,918 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:13,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957093871] [2019-10-13 21:33:13,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:13,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:13,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:14,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957093871] [2019-10-13 21:33:14,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603579330] [2019-10-13 21:33:14,083 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:14,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:14,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:14,209 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:14,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617524983] [2019-10-13 21:33:14,402 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:14,402 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:14,403 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:14,403 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:14,403 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:14,443 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:14,644 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:14,651 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:14,655 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:14,655 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:14,656 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:14,656 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:14,656 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:14,656 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:14,656 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:14,657 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:14,657 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:14,657 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:14,657 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:14,657 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:14,658 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) [2019-10-13 21:33:14,658 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:14,658 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:14,953 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:14,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-13 21:33:14,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933444966] [2019-10-13 21:33:14,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:33:14,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:14,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:33:14,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:33:14,957 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 35 states. [2019-10-13 21:33:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:16,239 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-10-13 21:33:16,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-13 21:33:16,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 29 [2019-10-13 21:33:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:16,241 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:33:16,241 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 21:33:16,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:33:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 21:33:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-10-13 21:33:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-13 21:33:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-10-13 21:33:16,253 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 29 [2019-10-13 21:33:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:16,253 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-10-13 21:33:16,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:33:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-10-13 21:33:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:33:16,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:16,255 INFO L380 BasicCegarLoop]: trace histogram [22, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:16,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:16,460 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash 243464513, now seen corresponding path program 5 times [2019-10-13 21:33:16,461 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:16,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927640677] [2019-10-13 21:33:16,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:16,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:16,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:16,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927640677] [2019-10-13 21:33:16,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716340918] [2019-10-13 21:33:16,829 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:16,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:16,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:16,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 21:33:16,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:17,119 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-13 21:33:17,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [610653519] [2019-10-13 21:33:17,318 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:17,318 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:17,318 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:17,319 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:17,319 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:17,346 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:17,489 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:17,498 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:17,501 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:17,502 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:17,502 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:17,502 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:17,503 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:17,503 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:17,503 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:17,503 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:17,503 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:17,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:17,506 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:17,507 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:17,507 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:33:17,507 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:17,507 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:17,932 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:17,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 10, 11] total 51 [2019-10-13 21:33:17,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285371492] [2019-10-13 21:33:17,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-13 21:33:17,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-13 21:33:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=2069, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 21:33:17,936 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 51 states. [2019-10-13 21:33:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:20,422 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-10-13 21:33:20,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-13 21:33:20,422 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 41 [2019-10-13 21:33:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:20,423 INFO L225 Difference]: With dead ends: 81 [2019-10-13 21:33:20,423 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 21:33:20,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1469, Invalid=7843, Unknown=0, NotChecked=0, Total=9312 [2019-10-13 21:33:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 21:33:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-13 21:33:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:33:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-10-13 21:33:20,436 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 41 [2019-10-13 21:33:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:20,436 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-10-13 21:33:20,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-13 21:33:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-10-13 21:33:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 21:33:20,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:20,438 INFO L380 BasicCegarLoop]: trace histogram [23, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:20,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:20,645 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2063520052, now seen corresponding path program 6 times [2019-10-13 21:33:20,646 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:20,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798673015] [2019-10-13 21:33:20,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:20,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:20,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:21,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798673015] [2019-10-13 21:33:21,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767401490] [2019-10-13 21:33:21,019 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:21,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:21,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:21,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:33:21,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:21,145 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:21,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [635109221] [2019-10-13 21:33:21,821 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:21,821 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:21,821 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:21,822 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:21,822 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:21,853 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:21,970 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:21,976 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:21,980 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:21,981 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:21,981 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:21,981 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:21,981 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:21,981 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:21,982 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:21,982 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:21,982 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:21,982 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:21,982 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:21,983 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:21,983 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) [2019-10-13 21:33:21,983 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:21,983 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:22,328 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:22,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-13 21:33:22,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191260096] [2019-10-13 21:33:22,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:33:22,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:33:22,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:33:22,333 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 61 states. [2019-10-13 21:33:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:24,933 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-10-13 21:33:24,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-13 21:33:24,934 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 51 [2019-10-13 21:33:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:24,935 INFO L225 Difference]: With dead ends: 115 [2019-10-13 21:33:24,936 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 21:33:24,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-13 21:33:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 21:33:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-10-13 21:33:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 21:33:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-10-13 21:33:24,951 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 51 [2019-10-13 21:33:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:24,952 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-10-13 21:33:24,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:33:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-10-13 21:33:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:33:24,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:24,955 INFO L380 BasicCegarLoop]: trace histogram [48, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:25,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:25,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1307214819, now seen corresponding path program 7 times [2019-10-13 21:33:25,166 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:25,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395659883] [2019-10-13 21:33:25,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:25,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:25,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:26,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395659883] [2019-10-13 21:33:26,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785427710] [2019-10-13 21:33:26,301 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:26,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:33:26,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:26,505 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:29,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1398549030] [2019-10-13 21:33:29,424 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:29,424 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:29,425 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:29,425 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:29,425 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:29,448 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:29,613 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:29,622 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:29,627 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:29,627 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:29,630 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:29,630 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:29,630 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:29,631 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:29,631 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:29,631 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,632 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,632 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,632 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:29,633 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:29,633 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) [2019-10-13 21:33:29,633 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:29,633 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:30,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:30,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-13 21:33:30,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118039688] [2019-10-13 21:33:30,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-13 21:33:30,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:30,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-13 21:33:30,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:33:30,691 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 111 states. [2019-10-13 21:33:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:39,098 INFO L93 Difference]: Finished difference Result 165 states and 218 transitions. [2019-10-13 21:33:39,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-13 21:33:39,098 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 76 [2019-10-13 21:33:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:39,101 INFO L225 Difference]: With dead ends: 165 [2019-10-13 21:33:39,101 INFO L226 Difference]: Without dead ends: 139 [2019-10-13 21:33:39,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9104 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=15032, Invalid=31408, Unknown=0, NotChecked=0, Total=46440 [2019-10-13 21:33:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-13 21:33:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2019-10-13 21:33:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-13 21:33:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-10-13 21:33:39,124 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 76 [2019-10-13 21:33:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:39,124 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-10-13 21:33:39,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-13 21:33:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-10-13 21:33:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:33:39,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:39,127 INFO L380 BasicCegarLoop]: trace histogram [98, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:39,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:39,336 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:39,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash -240161533, now seen corresponding path program 8 times [2019-10-13 21:33:39,337 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:39,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25241134] [2019-10-13 21:33:39,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:39,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4987 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-13 21:33:43,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25241134] [2019-10-13 21:33:43,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836971221] [2019-10-13 21:33:43,211 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:44,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-13 21:33:44,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:44,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-13 21:33:44,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4987 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-13 21:33:45,343 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4987 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-10-13 21:33:46,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1220049923] [2019-10-13 21:33:46,314 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:46,314 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:46,314 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:46,314 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:46,314 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:46,351 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:46,491 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:46,502 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:46,509 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:46,509 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:46,510 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,510 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,510 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:46,510 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:46,510 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 72#true [2019-10-13 21:33:46,511 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:46,511 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:46,511 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:46,511 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:46,511 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 120#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem7|) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:46,511 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) [2019-10-13 21:33:46,512 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 110#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,512 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 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))