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_partition_original_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:14:36,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:14:36,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:14:36,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:14:36,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:14:36,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:14:36,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:14:36,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:14:36,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:14:36,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:14:36,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:14:36,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:14:36,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:14:36,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:14:36,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:14:36,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:14:36,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:14:36,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:14:36,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:14:36,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:14:36,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:14:36,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:14:36,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:14:36,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:14:36,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:14:36,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:14:36,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:14:36,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:14:36,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:14:36,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:14:36,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:14:36,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:14:36,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:14:36,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:14:36,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:14:36,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:14:36,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:14:36,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:14:36,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:14:36,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:14:36,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:14:36,084 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-07 00:14:36,102 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:14:36,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:14:36,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:14:36,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:14:36,104 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:14:36,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:14:36,104 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:14:36,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:14:36,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:14:36,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:14:36,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:14:36,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:14:36,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:14:36,105 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:14:36,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:14:36,106 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:14:36,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:14:36,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:14:36,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:14:36,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:14:36,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:14:36,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:14:36,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:14:36,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:14:36,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:14:36,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:14:36,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:14:36,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:14:36,109 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-07 00:14:36,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:14:36,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:14:36,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:14:36,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:14:36,429 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:14:36,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_original_ground.i [2019-10-07 00:14:36,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc27c4780/afbc50cfd5eb41e4a210e227c222d982/FLAGab6858d21 [2019-10-07 00:14:36,943 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:14:36,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_original_ground.i [2019-10-07 00:14:36,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc27c4780/afbc50cfd5eb41e4a210e227c222d982/FLAGab6858d21 [2019-10-07 00:14:37,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc27c4780/afbc50cfd5eb41e4a210e227c222d982 [2019-10-07 00:14:37,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:14:37,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:14:37,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:14:37,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:14:37,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:14:37,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e36c1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37, skipping insertion in model container [2019-10-07 00:14:37,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,330 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:14:37,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:14:37,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:14:37,554 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:14:37,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:14:37,595 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:14:37,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37 WrapperNode [2019-10-07 00:14:37,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:14:37,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:14:37,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:14:37,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:14:37,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (1/1) ... [2019-10-07 00:14:37,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:14:37,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:14:37,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:14:37,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:14:37,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (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-07 00:14:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:14:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:14:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:14:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:14:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:14:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:14:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:14:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:14:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:14:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:14:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:14:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:14:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:14:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:14:38,266 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:14:38,267 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 00:14:38,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:14:38 BoogieIcfgContainer [2019-10-07 00:14:38,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:14:38,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:14:38,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:14:38,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:14:38,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:14:37" (1/3) ... [2019-10-07 00:14:38,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb23c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:14:38, skipping insertion in model container [2019-10-07 00:14:38,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:14:37" (2/3) ... [2019-10-07 00:14:38,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb23c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:14:38, skipping insertion in model container [2019-10-07 00:14:38,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:14:38" (3/3) ... [2019-10-07 00:14:38,276 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_original_ground.i [2019-10-07 00:14:38,286 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:14:38,294 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:14:38,306 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:14:38,334 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:14:38,334 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:14:38,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:14:38,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:14:38,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:14:38,335 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:14:38,335 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:14:38,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:14:38,353 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-07 00:14:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:14:38,359 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:38,360 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:38,362 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash -257326419, now seen corresponding path program 1 times [2019-10-07 00:14:38,374 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:38,374 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,374 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:38,539 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-07 00:14:38,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,540 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:14:38,541 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:14:38,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:14:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:14:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:14:38,563 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-07 00:14:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:38,605 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-07 00:14:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:14:38,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:14:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:38,621 INFO L225 Difference]: With dead ends: 39 [2019-10-07 00:14:38,622 INFO L226 Difference]: Without dead ends: 20 [2019-10-07 00:14:38,628 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:14:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-07 00:14:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-07 00:14:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 00:14:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-07 00:14:38,672 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2019-10-07 00:14:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:38,672 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-07 00:14:38,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:14:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-07 00:14:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:14:38,674 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:38,674 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:38,674 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:38,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:38,675 INFO L82 PathProgramCache]: Analyzing trace with hash 198286821, now seen corresponding path program 1 times [2019-10-07 00:14:38,675 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:38,676 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,676 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,676 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:38,737 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-07 00:14:38,738 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,739 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:14:38,739 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:14:38,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:14:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:14:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:14:38,742 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-07 00:14:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:38,762 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-07 00:14:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:14:38,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 00:14:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:38,764 INFO L225 Difference]: With dead ends: 33 [2019-10-07 00:14:38,765 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:14:38,766 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:14:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:14:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 00:14:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 00:14:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-07 00:14:38,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-10-07 00:14:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:38,776 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-07 00:14:38,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:14:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-07 00:14:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:14:38,776 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:38,777 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:38,777 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:38,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:38,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1699392540, now seen corresponding path program 1 times [2019-10-07 00:14:38,779 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:38,779 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,779 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:38,858 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-07 00:14:38,859 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:38,859 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:38,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:14:38,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:38,953 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-07 00:14:38,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:38,996 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-07 00:14:38,997 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:39,048 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:14:39,049 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:39,055 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:39,064 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:39,064 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:39,300 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:39,682 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:39,709 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:39,729 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:39,729 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:39,730 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:39,730 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:39,730 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:39,731 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-07 00:14:39,731 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-07 00:14:39,731 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:39,731 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:14:39,732 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:39,732 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:39,732 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-07 00:14:39,733 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:39,733 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:14:39,733 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:40,036 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:40,037 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 00:14:40,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:14:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:14:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:14:40,040 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 17 states. [2019-10-07 00:14:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:40,634 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-10-07 00:14:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:14:40,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-07 00:14:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:40,637 INFO L225 Difference]: With dead ends: 50 [2019-10-07 00:14:40,637 INFO L226 Difference]: Without dead ends: 36 [2019-10-07 00:14:40,642 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:14:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-07 00:14:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-10-07 00:14:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 00:14:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-10-07 00:14:40,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2019-10-07 00:14:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:40,665 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-10-07 00:14:40,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:14:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-10-07 00:14:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 00:14:40,666 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:40,667 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:40,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:40,871 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:40,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1573392980, now seen corresponding path program 2 times [2019-10-07 00:14:40,872 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:40,872 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:40,872 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:40,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:14:40,989 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:40,990 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:40,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:41,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:14:41,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:41,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:14:41,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:14:41,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:14:41,087 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:41,088 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:14:41,088 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:41,089 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:41,089 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:41,089 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:41,124 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:41,325 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:41,348 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:41,356 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:41,356 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:41,356 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:41,357 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) (<= __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-07 00:14:41,357 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:41,357 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-07 00:14:41,357 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-07 00:14:41,358 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:41,358 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:14:41,358 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:41,359 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:41,359 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) [2019-10-07 00:14:41,359 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) (<= __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-07 00:14:41,360 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:14:41,360 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:41,698 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:41,698 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-07 00:14:41,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-07 00:14:41,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-07 00:14:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-07 00:14:41,701 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 21 states. [2019-10-07 00:14:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:42,525 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-10-07 00:14:42,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-07 00:14:42,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-10-07 00:14:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:42,527 INFO L225 Difference]: With dead ends: 60 [2019-10-07 00:14:42,527 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 00:14:42,529 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 00:14:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 00:14:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-10-07 00:14:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-07 00:14:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-07 00:14:42,546 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2019-10-07 00:14:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:42,546 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-07 00:14:42,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-07 00:14:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-07 00:14:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 00:14:42,548 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:42,549 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:42,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:42,752 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1265542565, now seen corresponding path program 3 times [2019-10-07 00:14:42,753 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:42,754 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:42,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:42,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:14:42,882 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:42,882 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:42,882 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:42,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:14:42,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:42,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:14:42,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:14:43,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:14:43,143 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:43,145 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:14:43,145 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:43,146 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:43,146 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:43,146 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:43,175 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:43,348 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:43,363 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:43,369 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:43,370 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:43,370 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:43,370 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:43,371 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:43,371 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-07 00:14:43,371 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-07 00:14:43,371 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:43,372 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:14:43,372 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:43,372 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:43,372 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) [2019-10-07 00:14:43,373 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:43,373 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:14:43,373 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:43,702 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:43,703 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 11] total 29 [2019-10-07 00:14:43,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 00:14:43,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 00:14:43,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-10-07 00:14:43,705 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 29 states. [2019-10-07 00:14:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:44,842 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-10-07 00:14:44,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-07 00:14:44,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2019-10-07 00:14:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:44,844 INFO L225 Difference]: With dead ends: 71 [2019-10-07 00:14:44,844 INFO L226 Difference]: Without dead ends: 48 [2019-10-07 00:14:44,847 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=2357, Unknown=0, NotChecked=0, Total=2862 [2019-10-07 00:14:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-07 00:14:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-10-07 00:14:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-07 00:14:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-10-07 00:14:44,857 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 21 [2019-10-07 00:14:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:44,857 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-10-07 00:14:44,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 00:14:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-10-07 00:14:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 00:14:44,858 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:44,858 INFO L385 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:45,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:45,062 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:45,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:45,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1864631148, now seen corresponding path program 4 times [2019-10-07 00:14:45,063 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:45,063 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:45,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:45,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:45,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-07 00:14:45,242 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:45,243 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:45,243 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:45,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-07 00:14:45,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:14:45,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-07 00:14:45,828 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:45,829 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:14:45,829 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:45,830 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:45,830 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:45,830 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:45,853 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:45,982 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:45,990 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:45,995 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:45,995 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:45,995 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:45,996 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= 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-07 00:14:45,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:45,996 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-07 00:14:45,996 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-07 00:14:45,996 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:45,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:14:45,997 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:45,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:45,997 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= 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-07 00:14:45,997 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) [2019-10-07 00:14:45,998 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:14:45,998 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:46,355 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:46,356 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15, 11] total 44 [2019-10-07 00:14:46,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-07 00:14:46,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-07 00:14:46,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:14:46,358 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 44 states. [2019-10-07 00:14:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:48,172 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2019-10-07 00:14:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-07 00:14:48,172 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 29 [2019-10-07 00:14:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:48,174 INFO L225 Difference]: With dead ends: 87 [2019-10-07 00:14:48,174 INFO L226 Difference]: Without dead ends: 63 [2019-10-07 00:14:48,177 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1500, Invalid=5472, Unknown=0, NotChecked=0, Total=6972 [2019-10-07 00:14:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-07 00:14:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-10-07 00:14:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 00:14:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-07 00:14:48,187 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 29 [2019-10-07 00:14:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:48,187 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-07 00:14:48,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-07 00:14:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-07 00:14:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 00:14:48,189 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:48,189 INFO L385 BasicCegarLoop]: trace histogram [26, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:48,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:48,394 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:48,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 480310349, now seen corresponding path program 5 times [2019-10-07 00:14:48,395 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:48,395 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:48,396 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:48,396 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 00:14:48,848 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:48,849 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:48,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:49,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 00:14:49,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:49,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 00:14:49,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:14:49,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-07 00:14:49,456 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:49,457 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:14:49,457 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:49,458 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:49,460 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:49,461 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:49,493 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:49,622 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:49,633 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:49,638 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:49,638 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:49,638 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:49,639 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= 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-07 00:14:49,639 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:49,639 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-07 00:14:49,639 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-07 00:14:49,640 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:49,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:14:49,640 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:49,641 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:49,641 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= 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-07 00:14:49,641 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) [2019-10-07 00:14:49,641 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:14:49,642 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:50,171 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:50,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-07 00:14:50,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-07 00:14:50,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-07 00:14:50,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-07 00:14:50,177 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 53 states. [2019-10-07 00:14:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:52,535 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2019-10-07 00:14:52,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-07 00:14:52,536 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 44 [2019-10-07 00:14:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:52,537 INFO L225 Difference]: With dead ends: 97 [2019-10-07 00:14:52,537 INFO L226 Difference]: Without dead ends: 72 [2019-10-07 00:14:52,541 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2223 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2107, Invalid=8195, Unknown=0, NotChecked=0, Total=10302 [2019-10-07 00:14:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-07 00:14:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-10-07 00:14:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-07 00:14:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-10-07 00:14:52,551 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 44 [2019-10-07 00:14:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:52,551 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-10-07 00:14:52,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-07 00:14:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-10-07 00:14:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 00:14:52,553 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:52,553 INFO L385 BasicCegarLoop]: trace histogram [27, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:52,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:52,758 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:52,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1160534789, now seen corresponding path program 6 times [2019-10-07 00:14:52,759 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:52,759 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:52,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:52,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:14:53,157 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:53,157 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:53,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:53,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:14:53,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:14:53,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-07 00:14:53,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:14:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:14:53,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:14:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:14:54,691 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:14:54,692 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:14:54,692 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:14:54,693 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:14:54,693 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:14:54,693 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:14:54,726 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:14:54,862 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:14:54,869 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:14:54,875 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:14:54,875 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:14:54,875 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:14:54,876 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) (<= 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-07 00:14:54,876 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:14:54,876 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-07 00:14:54,876 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:14:54,876 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-07 00:14:54,877 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:14:54,877 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:14:54,877 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:14:54,877 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) (<= 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-07 00:14:54,877 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) [2019-10-07 00:14:54,878 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:14:54,878 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:14:55,251 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:14:55,252 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-07 00:14:55,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-07 00:14:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-07 00:14:55,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-07 00:14:55,256 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 69 states. [2019-10-07 00:14:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:14:58,402 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2019-10-07 00:14:58,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-07 00:14:58,403 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 53 [2019-10-07 00:14:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:14:58,405 INFO L225 Difference]: With dead ends: 134 [2019-10-07 00:14:58,405 INFO L226 Difference]: Without dead ends: 101 [2019-10-07 00:14:58,410 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-07 00:14:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-07 00:14:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2019-10-07 00:14:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-07 00:14:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2019-10-07 00:14:58,422 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 53 [2019-10-07 00:14:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:14:58,423 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2019-10-07 00:14:58,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-07 00:14:58,423 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2019-10-07 00:14:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-07 00:14:58,426 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:14:58,426 INFO L385 BasicCegarLoop]: trace histogram [56, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:14:58,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:14:58,632 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:14:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:14:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1515970355, now seen corresponding path program 7 times [2019-10-07 00:14:58,633 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:14:58,633 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:58,633 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:58,634 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:14:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:14:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:14:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:14:59,964 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:14:59,964 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:14:59,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:00,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-07 00:15:00,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:15:00,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:15:03,685 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:03,688 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:03,688 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:03,689 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:03,689 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:03,689 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:03,710 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:03,867 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:15:03,876 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:03,879 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:03,880 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:03,880 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:03,880 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) (<= __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-07 00:15:03,880 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:03,881 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-07 00:15:03,881 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:15:03,881 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-07 00:15:03,881 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:15:03,882 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:03,882 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:03,882 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) (<= __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-07 00:15:03,883 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) [2019-10-07 00:15:03,883 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:15:03,883 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:15:04,762 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:04,762 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-07 00:15:04,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-07 00:15:04,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-07 00:15:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-07 00:15:04,777 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 127 states. [2019-10-07 00:15:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:14,567 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2019-10-07 00:15:14,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-07 00:15:14,588 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 82 [2019-10-07 00:15:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:14,589 INFO L225 Difference]: With dead ends: 192 [2019-10-07 00:15:14,590 INFO L226 Difference]: Without dead ends: 159 [2019-10-07 00:15:14,593 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-07 00:15:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-07 00:15:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2019-10-07 00:15:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-07 00:15:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-10-07 00:15:14,611 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 82 [2019-10-07 00:15:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:14,612 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-10-07 00:15:14,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-07 00:15:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-10-07 00:15:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-07 00:15:14,614 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:14,614 INFO L385 BasicCegarLoop]: trace histogram [114, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:14,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:14,819 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:14,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:14,819 INFO L82 PathProgramCache]: Analyzing trace with hash -170652723, now seen corresponding path program 8 times [2019-10-07 00:15:14,820 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:14,820 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:14,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:14,820 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-07 00:15:19,748 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:19,748 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:19,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:26,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-07 00:15:26,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:26,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-07 00:15:26,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:15:27,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6660 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6555 trivial. 0 not checked. [2019-10-07 00:15:28,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:28,487 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:28,487 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:28,487 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:28,488 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:28,488 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:28,509 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:28,616 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:15:28,621 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:28,623 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:28,623 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:28,624 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_23 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (v_prenex_24 Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_24) v_prenex_23)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~0.offset_BEFORE_CALL_8|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:28,624 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (v_prenex_24 Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_24) v_prenex_23)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~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-07 00:15:28,624 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:28,624 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-07 00:15:28,624 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:15:28,624 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-07 00:15:28,624 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:15:28,624 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:15:28,625 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:28,625 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (v_prenex_24 Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_24) v_prenex_23)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~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-07 00:15:28,625 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_23 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_8| Int) (v_prenex_24 Int) (|v_main_~#bb~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_24) v_prenex_23)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_8|) |v_main_~#bb~0.offset_BEFORE_CALL_8|))))) [2019-10-07 00:15:28,625 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:15:28,625 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:15:29,497 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:29,497 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 17, 17, 11] total 157 [2019-10-07 00:15:29,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-10-07 00:15:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-10-07 00:15:29,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7310, Invalid=17182, Unknown=0, NotChecked=0, Total=24492 [2019-10-07 00:15:29,502 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 157 states. [2019-10-07 00:15:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:45,141 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2019-10-07 00:15:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-10-07 00:15:45,142 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 140 [2019-10-07 00:15:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:45,144 INFO L225 Difference]: With dead ends: 209 [2019-10-07 00:15:45,144 INFO L226 Difference]: Without dead ends: 176 [2019-10-07 00:15:45,149 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17383 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=25583, Invalid=70207, Unknown=0, NotChecked=0, Total=95790 [2019-10-07 00:15:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-07 00:15:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2019-10-07 00:15:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-07 00:15:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 176 transitions. [2019-10-07 00:15:45,166 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 176 transitions. Word has length 140 [2019-10-07 00:15:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:45,166 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 176 transitions. [2019-10-07 00:15:45,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-10-07 00:15:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 176 transitions. [2019-10-07 00:15:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-07 00:15:45,169 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:45,170 INFO L385 BasicCegarLoop]: trace histogram [115, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:45,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:45,378 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:45,379 INFO L82 PathProgramCache]: Analyzing trace with hash 986349061, now seen corresponding path program 9 times [2019-10-07 00:15:45,380 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:45,380 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:45,380 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:45,380 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7135 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:15:50,280 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:50,280 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:50,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:50,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:15:50,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:50,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-07 00:15:50,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7135 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:15:50,606 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:16:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7135 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:16:04,582 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:16:04,583 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:16:04,583 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:16:04,584 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:16:04,584 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:16:04,584 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:16:04,603 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:16:04,712 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:16:04,720 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:16:04,722 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:16:04,722 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:16:04,723 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_27 Int) (v_prenex_26 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_26) v_prenex_27)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:04,723 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_27 Int) (v_prenex_26 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_26) v_prenex_27)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:04,723 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:16:04,723 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-07 00:16:04,723 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:16:04,723 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-07 00:16:04,724 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:16:04,724 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:16:04,724 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:16:04,724 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_27 Int) (v_prenex_26 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_26) v_prenex_27)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:16:04,724 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((|v_main_~#bb~0.base_BEFORE_CALL_9| Int) (v_prenex_27 Int) (v_prenex_26 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_9|) |v_main_~#bb~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_26) v_prenex_27)))))) [2019-10-07 00:16:04,724 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:16:04,725 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:16:05,514 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:16:05,514 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-07 00:16:05,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-07 00:16:05,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-07 00:16:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-07 00:16:05,521 INFO L87 Difference]: Start difference. First operand 170 states and 176 transitions. Second operand 245 states. [2019-10-07 00:16:38,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:16:38,446 INFO L93 Difference]: Finished difference Result 342 states and 470 transitions. [2019-10-07 00:16:38,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-07 00:16:38,447 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 157 [2019-10-07 00:16:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:16:38,449 INFO L225 Difference]: With dead ends: 342 [2019-10-07 00:16:38,449 INFO L226 Difference]: Without dead ends: 293 [2019-10-07 00:16:38,458 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-07 00:16:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-07 00:16:38,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-10-07 00:16:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-07 00:16:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 293 transitions. [2019-10-07 00:16:38,483 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 293 transitions. Word has length 157 [2019-10-07 00:16:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:16:38,483 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 293 transitions. [2019-10-07 00:16:38,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-07 00:16:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 293 transitions. [2019-10-07 00:16:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-07 00:16:38,488 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:16:38,489 INFO L385 BasicCegarLoop]: trace histogram [232, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:16:38,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:16:38,696 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:16:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:16:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash -111947827, now seen corresponding path program 10 times [2019-10-07 00:16:38,697 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:16:38,697 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:38,698 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:38,698 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:16:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:16:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27493 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:16:57,870 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:57,870 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:16:57,870 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:16:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:16:58,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-07 00:16:58,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:16:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 27493 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:16:58,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:17:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 27493 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:17:55,504 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:17:55,505 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:17:55,505 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:17:55,506 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:17:55,506 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:17:55,506 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:17:55,545 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:17:55,641 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:17:55,646 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:17:55,649 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:17:55,649 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:17:55,649 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_29 Int) (|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (v_prenex_30 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_29) v_prenex_30))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:17:55,650 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (exists ((v_prenex_29 Int) (|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (v_prenex_30 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_29) v_prenex_30))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))))) (<= __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-07 00:17:55,650 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:17:55,650 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-07 00:17:55,650 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-07 00:17:55,650 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-07 00:17:55,650 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(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-07 00:17:55,651 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:17:55,651 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:17:55,651 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (exists ((v_prenex_29 Int) (|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (v_prenex_30 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_29) v_prenex_30))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))))) (<= __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-07 00:17:55,651 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_29 Int) (|v_main_~#bb~0.base_BEFORE_CALL_10| Int) (v_prenex_30 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_29) v_prenex_30))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_10|) |v_main_~#bb~0.offset_BEFORE_CALL_10|)))))) [2019-10-07 00:17:55,651 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* 4 main_~x~0) |main_~#bb~0.offset|)) |main_#t~mem6|)) [2019-10-07 00:17:55,651 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-07 00:17:57,056 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:17:57,057 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-07 00:17:57,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-07 00:17:57,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-07 00:17:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-07 00:17:57,081 INFO L87 Difference]: Start difference. First operand 287 states and 293 transitions. Second operand 479 states. [2019-10-07 00:20:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:20:08,437 INFO L93 Difference]: Finished difference Result 576 states and 821 transitions. [2019-10-07 00:20:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-07 00:20:08,437 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 274 [2019-10-07 00:20:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:20:08,440 INFO L225 Difference]: With dead ends: 576 [2019-10-07 00:20:08,440 INFO L226 Difference]: Without dead ends: 527 [2019-10-07 00:20:08,465 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1530 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 197.3s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-07 00:20:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-07 00:20:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 521. [2019-10-07 00:20:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-07 00:20:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 527 transitions. [2019-10-07 00:20:08,496 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 527 transitions. Word has length 274 [2019-10-07 00:20:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:20:08,497 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 527 transitions. [2019-10-07 00:20:08,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-07 00:20:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 527 transitions. [2019-10-07 00:20:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-10-07 00:20:08,509 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:20:08,509 INFO L385 BasicCegarLoop]: trace histogram [466, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:20:08,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:20:08,716 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:20:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:20:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 705438413, now seen corresponding path program 11 times [2019-10-07 00:20:08,717 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:20:08,717 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:20:08,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:20:08,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:20:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:20:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:21:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 109276 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-07 00:21:25,540 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:21:25,540 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:21:25,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true