java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_copy1_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:30:21,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:30:21,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:30:21,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:30:21,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:30:21,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:30:21,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:30:21,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:30:21,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:30:21,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:30:21,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:30:21,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:30:21,216 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:30:21,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:30:21,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:30:21,219 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:30:21,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:30:21,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:30:21,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:30:21,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:30:21,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:30:21,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:30:21,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:30:21,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:30:21,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:30:21,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:30:21,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:30:21,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:30:21,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:30:21,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:30:21,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:30:21,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:30:21,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:30:21,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:30:21,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:30:21,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:30:21,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:30:21,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:30:21,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:30:21,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:30:21,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:30:21,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:30:21,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:30:21,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:30:21,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:30:21,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:30:21,257 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:30:21,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:30:21,257 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:30:21,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:30:21,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:30:21,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:30:21,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:30:21,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:30:21,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:30:21,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:30:21,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:30:21,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:30:21,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:30:21,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:30:21,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:30:21,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:30:21,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:30:21,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:30:21,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:30:21,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:30:21,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:30:21,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:30:21,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:30:21,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:30:21,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:30:21,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:30:21,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:30:21,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:30:21,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:30:21,553 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:30:21,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_ground-1.i [2019-10-06 23:30:21,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8062b7e8/0a765261c3c341518ecc9124c65a46b5/FLAG21b8399e0 [2019-10-06 23:30:22,056 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:30:22,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_ground-1.i [2019-10-06 23:30:22,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8062b7e8/0a765261c3c341518ecc9124c65a46b5/FLAG21b8399e0 [2019-10-06 23:30:22,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8062b7e8/0a765261c3c341518ecc9124c65a46b5 [2019-10-06 23:30:22,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:30:22,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:30:22,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:22,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:30:22,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:30:22,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599a6431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22, skipping insertion in model container [2019-10-06 23:30:22,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,470 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:30:22,487 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:30:22,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:22,672 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:30:22,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:22,726 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:30:22,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22 WrapperNode [2019-10-06 23:30:22,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:22,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:30:22,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:30:22,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:30:22,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... [2019-10-06 23:30:22,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:30:22,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:30:22,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:30:22,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:30:22,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:30:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:30:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:30:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:30:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:30:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:30:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:30:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:30:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:30:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:30:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:30:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:30:22,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:30:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:30:22,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:30:23,240 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:30:23,240 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:30:23,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:23 BoogieIcfgContainer [2019-10-06 23:30:23,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:30:23,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:30:23,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:30:23,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:30:23,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:30:22" (1/3) ... [2019-10-06 23:30:23,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4b3bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:23, skipping insertion in model container [2019-10-06 23:30:23,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:22" (2/3) ... [2019-10-06 23:30:23,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d4b3bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:23, skipping insertion in model container [2019-10-06 23:30:23,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:23" (3/3) ... [2019-10-06 23:30:23,256 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy1_ground-1.i [2019-10-06 23:30:23,277 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:30:23,286 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:30:23,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:30:23,324 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:30:23,324 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:30:23,324 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:30:23,325 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:30:23,325 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:30:23,325 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:30:23,325 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:30:23,325 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:30:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-06 23:30:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:30:23,344 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:23,345 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:23,347 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:23,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash -973561822, now seen corresponding path program 1 times [2019-10-06 23:30:23,360 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:23,360 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:23,360 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:23,360 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:30:23,549 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:23,549 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:23,550 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:23,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:23,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:23,578 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-06 23:30:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:23,638 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-06 23:30:23,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:23,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-06 23:30:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:23,651 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:30:23,651 INFO L226 Difference]: Without dead ends: 17 [2019-10-06 23:30:23,658 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-06 23:30:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-06 23:30:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-06 23:30:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-06 23:30:23,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-06 23:30:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:23,709 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-06 23:30:23,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-06 23:30:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:30:23,712 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:23,712 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:23,713 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:23,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1904463274, now seen corresponding path program 1 times [2019-10-06 23:30:23,715 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:23,715 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:23,715 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:23,716 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:30:23,794 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:23,794 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:23,794 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:23,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:23,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:23,797 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-06 23:30:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:23,814 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-06 23:30:23,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:23,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:30:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:23,818 INFO L225 Difference]: With dead ends: 27 [2019-10-06 23:30:23,818 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:30:23,819 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:30:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:30:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:30:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-06 23:30:23,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-06 23:30:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:23,829 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-06 23:30:23,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-06 23:30:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:30:23,830 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:23,830 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:23,831 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1479457838, now seen corresponding path program 1 times [2019-10-06 23:30:23,831 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:23,832 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:23,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:23,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:23,901 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-06 23:30:23,902 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:23,902 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:23,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:23,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:30:23,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:24,014 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-06 23:30:24,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:24,049 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-06 23:30:24,049 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:24,075 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:24,075 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:24,086 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:24,094 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:24,094 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:24,300 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:24,743 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:30:24,850 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:24,878 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:24,888 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:24,889 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:24,889 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:24,890 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:24,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:24,891 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:24,891 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:30:24,891 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:24,892 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:24,892 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:24,892 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:24,893 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:24,894 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:24,894 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) [2019-10-06 23:30:24,894 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:25,250 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:25,251 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:30:25,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:30:25,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:30:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:30:25,256 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-06 23:30:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:25,922 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-10-06 23:30:25,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:30:25,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-06 23:30:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:25,924 INFO L225 Difference]: With dead ends: 42 [2019-10-06 23:30:25,924 INFO L226 Difference]: Without dead ends: 31 [2019-10-06 23:30:25,926 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:30:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-06 23:30:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-06 23:30:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:30:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-06 23:30:25,941 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-06 23:30:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:25,942 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-06 23:30:25,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:30:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-06 23:30:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:30:25,944 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:25,944 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:26,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:26,149 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:26,150 INFO L82 PathProgramCache]: Analyzing trace with hash 689715618, now seen corresponding path program 2 times [2019-10-06 23:30:26,150 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:26,150 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:26,150 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:26,151 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:30:26,237 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:26,237 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:26,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:26,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:30:26,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:26,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:30:26,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:26,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:26,358 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:26,360 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:26,360 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:26,360 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:26,361 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:26,361 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:26,391 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:26,726 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:26,747 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:26,753 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:26,753 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:26,753 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:26,754 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:26,754 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:26,754 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:26,755 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:30:26,755 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:26,755 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:26,755 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:26,756 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:26,756 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:26,756 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:26,756 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) [2019-10-06 23:30:26,757 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:27,095 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:27,095 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-06 23:30:27,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:30:27,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:30:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:30:27,097 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 23 states. [2019-10-06 23:30:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:27,891 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-10-06 23:30:27,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:30:27,892 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2019-10-06 23:30:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:27,893 INFO L225 Difference]: With dead ends: 48 [2019-10-06 23:30:27,893 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:30:27,896 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:30:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:30:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-10-06 23:30:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-06 23:30:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-06 23:30:27,907 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-06 23:30:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:27,908 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-06 23:30:27,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:30:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-06 23:30:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-06 23:30:27,910 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:27,912 INFO L385 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:28,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:28,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1653576662, now seen corresponding path program 3 times [2019-10-06 23:30:28,125 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:28,126 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:28,126 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:28,126 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:30:28,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:28,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:28,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:28,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:28,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:28,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:30:28,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:30:28,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:30:28,410 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:28,412 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:28,412 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:28,412 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:28,412 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:28,413 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:28,457 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:28,770 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:28,788 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:28,793 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:28,793 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:28,794 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:28,794 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:28,794 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:28,794 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:28,794 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:30:28,795 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:28,795 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:28,795 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:28,795 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:28,795 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:28,796 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:28,796 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) [2019-10-06 23:30:28,796 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:29,171 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:29,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-06 23:30:29,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:30:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:30:29,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:30:29,175 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 25 states. [2019-10-06 23:30:29,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:29,992 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2019-10-06 23:30:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:30:29,993 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 23 [2019-10-06 23:30:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:29,994 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:30:29,994 INFO L226 Difference]: Without dead ends: 43 [2019-10-06 23:30:29,996 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:30:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-06 23:30:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-06 23:30:30,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:30:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-06 23:30:30,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2019-10-06 23:30:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:30,008 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-06 23:30:30,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:30:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-06 23:30:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:30:30,010 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:30,010 INFO L385 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:30,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:30,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 655953058, now seen corresponding path program 4 times [2019-10-06 23:30:30,223 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:30,223 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:30,224 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:30,224 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:30:30,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:30,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:30,388 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:30,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:30:30,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:30:30,479 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:30:30,713 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:30,714 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:30,714 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:30,715 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:30,715 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:30,715 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:30,740 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:31,019 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:31,030 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:31,034 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:31,034 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:31,035 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,035 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,035 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:31,035 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:31,035 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:30:31,036 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:31,036 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:31,036 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:31,036 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:31,036 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:31,037 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,037 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) [2019-10-06 23:30:31,037 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:31,351 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:31,351 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-06 23:30:31,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:30:31,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:30:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:30:31,356 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 39 states. [2019-10-06 23:30:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:32,751 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-06 23:30:32,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:30:32,752 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 30 [2019-10-06 23:30:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:32,753 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:30:32,753 INFO L226 Difference]: Without dead ends: 57 [2019-10-06 23:30:32,756 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:30:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-06 23:30:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-06 23:30:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-06 23:30:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-10-06 23:30:32,765 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 30 [2019-10-06 23:30:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:32,765 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-10-06 23:30:32,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:30:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-10-06 23:30:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-06 23:30:32,767 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:32,767 INFO L385 BasicCegarLoop]: trace histogram [26, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:32,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:32,971 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1347975714, now seen corresponding path program 5 times [2019-10-06 23:30:32,972 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:32,972 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:32,972 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:32,973 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:33,371 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-06 23:30:33,372 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:33,372 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:33,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:33,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:30:33,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:33,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:30:33,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:33,593 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-06 23:30:33,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:33,757 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-06 23:30:33,757 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:33,758 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:33,758 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:33,759 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:33,759 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:33,759 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:33,799 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:34,025 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:34,031 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:34,034 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:34,034 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:34,034 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:34,034 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:34,035 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:34,035 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:34,035 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:30:34,035 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:34,035 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:30:34,036 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:34,036 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:34,036 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:34,036 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:34,036 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:30:34,037 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:34,470 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:34,471 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-06 23:30:34,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-06 23:30:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-06 23:30:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:30:34,473 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 53 states. [2019-10-06 23:30:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:37,006 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2019-10-06 23:30:37,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-06 23:30:37,007 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 44 [2019-10-06 23:30:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:37,008 INFO L225 Difference]: With dead ends: 82 [2019-10-06 23:30:37,009 INFO L226 Difference]: Without dead ends: 66 [2019-10-06 23:30:37,012 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1684, Invalid=8416, Unknown=0, NotChecked=0, Total=10100 [2019-10-06 23:30:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-06 23:30:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-10-06 23:30:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-06 23:30:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-10-06 23:30:37,022 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2019-10-06 23:30:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:37,022 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-10-06 23:30:37,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-06 23:30:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-10-06 23:30:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-06 23:30:37,024 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:37,024 INFO L385 BasicCegarLoop]: trace histogram [27, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:37,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:37,228 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:37,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1171372630, now seen corresponding path program 6 times [2019-10-06 23:30:37,230 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:37,230 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:37,230 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:37,230 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:37,671 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-06 23:30:37,671 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:37,672 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:37,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:37,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:37,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:37,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:30:37,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:37,795 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-06 23:30:37,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:38,816 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-06 23:30:38,816 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:38,817 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:38,818 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:38,819 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:38,819 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:38,819 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:38,842 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:39,084 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:39,090 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:39,093 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:39,093 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:39,093 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:39,093 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:39,094 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:39,094 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:39,094 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:30:39,094 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:39,094 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:39,094 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:39,095 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:39,095 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:39,095 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:39,095 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) [2019-10-06 23:30:39,096 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:39,463 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:39,463 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-06 23:30:39,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-06 23:30:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-06 23:30:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:30:39,467 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 69 states. [2019-10-06 23:30:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:42,516 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2019-10-06 23:30:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:30:42,517 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 53 [2019-10-06 23:30:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:42,518 INFO L225 Difference]: With dead ends: 119 [2019-10-06 23:30:42,519 INFO L226 Difference]: Without dead ends: 95 [2019-10-06 23:30:42,523 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-06 23:30:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-06 23:30:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2019-10-06 23:30:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-06 23:30:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2019-10-06 23:30:42,535 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 53 [2019-10-06 23:30:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:42,536 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2019-10-06 23:30:42,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-06 23:30:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2019-10-06 23:30:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-06 23:30:42,538 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:42,538 INFO L385 BasicCegarLoop]: trace histogram [56, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:42,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:42,742 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:42,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash -696685150, now seen corresponding path program 7 times [2019-10-06 23:30:42,743 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:42,743 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:42,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:42,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:44,081 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-06 23:30:44,082 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:44,082 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:44,082 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:44,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:30:44,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:44,252 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-06 23:30:44,252 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:47,770 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-06 23:30:47,771 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:47,772 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:30:47,772 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:47,772 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:47,772 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:47,773 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:47,798 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:48,011 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:48,016 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:48,019 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:48,019 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:48,019 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:48,019 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:48,019 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:48,020 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:48,020 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:30:48,020 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:48,020 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:48,020 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:48,021 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:48,021 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:48,021 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:48,021 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) [2019-10-06 23:30:48,021 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:48,551 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:48,551 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:30:48,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:30:48,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:30:48,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:30:48,558 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 127 states. [2019-10-06 23:30:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:57,937 INFO L93 Difference]: Finished difference Result 177 states and 238 transitions. [2019-10-06 23:30:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:30:57,938 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 82 [2019-10-06 23:30:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:57,939 INFO L225 Difference]: With dead ends: 177 [2019-10-06 23:30:57,940 INFO L226 Difference]: Without dead ends: 153 [2019-10-06 23:30:57,944 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:30:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-06 23:30:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2019-10-06 23:30:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-06 23:30:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-10-06 23:30:57,961 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 82 [2019-10-06 23:30:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:57,962 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-10-06 23:30:57,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:30:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-10-06 23:30:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-06 23:30:57,964 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:57,964 INFO L385 BasicCegarLoop]: trace histogram [114, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:58,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:58,168 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1619020322, now seen corresponding path program 8 times [2019-10-06 23:30:58,169 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:58,170 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:58,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:58,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:03,137 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-06 23:31:03,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:03,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:03,138 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-06 23:31:04,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-06 23:31:04,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:04,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-06 23:31:04,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:05,313 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-06 23:31:05,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:06,219 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-06 23:31:06,220 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:06,221 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:31:06,221 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:06,221 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:06,222 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:06,222 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:06,238 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:06,484 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:06,489 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:06,492 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:06,492 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:06,492 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:06,493 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:06,493 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:06,493 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:06,493 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:31:06,493 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:06,493 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:06,494 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:06,494 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:06,494 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:06,494 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:06,494 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_29 Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (|v_main_~#a2~0.base_BEFORE_CALL_8| Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_8|) |v_main_~#a2~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) [2019-10-06 23:31:06,495 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:07,444 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:07,444 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 17, 17, 11] total 157 [2019-10-06 23:31:07,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 157 states [2019-10-06 23:31:07,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2019-10-06 23:31:07,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7310, Invalid=17182, Unknown=0, NotChecked=0, Total=24492 [2019-10-06 23:31:07,449 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 157 states. [2019-10-06 23:31:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:22,358 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2019-10-06 23:31:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-10-06 23:31:22,359 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 140 [2019-10-06 23:31:22,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:22,361 INFO L225 Difference]: With dead ends: 194 [2019-10-06 23:31:22,361 INFO L226 Difference]: Without dead ends: 170 [2019-10-06 23:31:22,364 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18838 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=21984, Invalid=73188, Unknown=0, NotChecked=0, Total=95172 [2019-10-06 23:31:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-06 23:31:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2019-10-06 23:31:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-06 23:31:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-10-06 23:31:22,384 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 140 [2019-10-06 23:31:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:22,385 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-10-06 23:31:22,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 157 states. [2019-10-06 23:31:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-10-06 23:31:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-06 23:31:22,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:22,388 INFO L385 BasicCegarLoop]: trace histogram [115, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:22,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:22,592 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash -614098858, now seen corresponding path program 9 times [2019-10-06 23:31:22,593 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:22,593 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:22,593 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:22,594 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:27,501 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-06 23:31:27,501 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:27,501 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:27,502 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-06 23:31:27,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:27,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:27,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:31:27,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:27,801 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-06 23:31:27,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:41,896 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-06 23:31:41,896 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:41,897 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:31:41,897 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:41,897 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:41,898 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:41,898 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:41,918 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:42,149 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:42,159 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:42,162 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:42,162 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:42,162 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:42,162 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:42,163 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:42,163 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:42,163 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:31:42,163 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:42,163 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:31:42,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:42,164 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:42,164 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:42,164 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:42,164 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a2~0.base_BEFORE_CALL_9| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_9|) |v_main_~#a2~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_35) v_prenex_36) (select (select |#memory_int| v_prenex_33) v_prenex_34)))))) [2019-10-06 23:31:42,164 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:43,047 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:43,047 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-06 23:31:43,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:31:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:31:43,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:31:43,053 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 245 states. [2019-10-06 23:32:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:32:15,999 INFO L93 Difference]: Finished difference Result 327 states and 447 transitions. [2019-10-06 23:32:15,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-06 23:32:16,000 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 157 [2019-10-06 23:32:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:32:16,002 INFO L225 Difference]: With dead ends: 327 [2019-10-06 23:32:16,002 INFO L226 Difference]: Without dead ends: 287 [2019-10-06 23:32:16,008 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-06 23:32:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-06 23:32:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 278. [2019-10-06 23:32:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-06 23:32:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 280 transitions. [2019-10-06 23:32:16,032 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 280 transitions. Word has length 157 [2019-10-06 23:32:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:32:16,033 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 280 transitions. [2019-10-06 23:32:16,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:32:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 280 transitions. [2019-10-06 23:32:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-06 23:32:16,038 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:32:16,038 INFO L385 BasicCegarLoop]: trace histogram [232, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:32:16,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:16,243 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:32:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:32:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash 621612450, now seen corresponding path program 10 times [2019-10-06 23:32:16,243 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:32:16,243 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:16,243 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:16,244 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:16,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:32:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:35,623 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-06 23:32:35,623 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:35,623 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:32:35,624 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-06 23:32:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:36,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:32:36,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:32:36,110 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-06 23:32:36,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:34,139 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-06 23:33:34,140 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:34,141 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:33:34,141 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:34,142 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:34,142 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:34,142 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:34,176 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:34,419 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:34,426 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:34,428 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:34,428 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:34,428 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:34,428 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:34,429 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:34,429 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:34,429 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:33:34,429 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:34,429 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:34,429 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:34,429 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:34,430 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:34,430 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:34,430 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a2~0.offset_BEFORE_CALL_10| Int) (v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a2~0.base_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_10|) |v_main_~#a2~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_39) v_prenex_37) (select (select |#memory_int| v_prenex_40) v_prenex_38))))) [2019-10-06 23:33:34,433 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:35,913 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:35,914 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-06 23:33:35,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-06 23:33:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-06 23:33:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-06 23:33:35,928 INFO L87 Difference]: Start difference. First operand 278 states and 280 transitions. Second operand 479 states. [2019-10-06 23:35:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:35:43,590 INFO L93 Difference]: Finished difference Result 561 states and 798 transitions. [2019-10-06 23:35:43,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-06 23:35:43,590 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 274 [2019-10-06 23:35:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:35:43,594 INFO L225 Difference]: With dead ends: 561 [2019-10-06 23:35:43,594 INFO L226 Difference]: Without dead ends: 521 [2019-10-06 23:35:43,610 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1530 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 196.6s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-06 23:35:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-10-06 23:35:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 512. [2019-10-06 23:35:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-06 23:35:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 514 transitions. [2019-10-06 23:35:43,640 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 514 transitions. Word has length 274 [2019-10-06 23:35:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:35:43,641 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 514 transitions. [2019-10-06 23:35:43,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-06 23:35:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 514 transitions. [2019-10-06 23:35:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-10-06 23:35:43,652 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:35:43,652 INFO L385 BasicCegarLoop]: trace histogram [466, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:35:43,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:35:43,865 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:35:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:35:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash 185312802, now seen corresponding path program 11 times [2019-10-06 23:35:43,866 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:35:43,867 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:35:43,867 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:35:43,867 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:35:43,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:35:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:00,764 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-06 23:37:00,764 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:00,764 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:00,764 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 [2019-10-06 23:39:13,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-06 23:39:13,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:39:13,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-06 23:39:13,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:39:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 109276 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-06 23:39:19,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:39:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 109276 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 108811 trivial. 0 not checked. [2019-10-06 23:39:26,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:39:26,916 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-06 23:39:26,916 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:39:26,916 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:39:26,916 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:39:26,917 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:39:26,939 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:39:27,260 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:39:27,265 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:39:27,268 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:39:27,268 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:39:27,269 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:39:27,269 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:39:27,269 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:39:27,269 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:39:27,269 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:39:27,270 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:39:27,270 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:39:27,270 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:39:27,270 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem6| (select (select |#memory_int| |main_~#a2~0.base|) (+ (* 4 main_~x~0) |main_~#a2~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:39:27,270 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:39:27,271 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:39:27,271 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a1~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (|v_main_~#a2~0.base_BEFORE_CALL_11| Int) (|v_main_~#a1~0.base_BEFORE_CALL_11| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_11| Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_42) v_prenex_44) (select (select |#memory_int| v_prenex_43) v_prenex_41))) (and (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_11|) |v_main_~#a2~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_11|) |v_main_~#a1~0.offset_BEFORE_CALL_11|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:39:27,271 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:39:30,164 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:39:30,165 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 33, 33, 11] total 541 [2019-10-06 23:39:30,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 541 states [2019-10-06 23:39:30,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 541 interpolants. [2019-10-06 23:39:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111790, Invalid=180350, Unknown=0, NotChecked=0, Total=292140 [2019-10-06 23:39:30,183 INFO L87 Difference]: Start difference. First operand 512 states and 514 transitions. Second operand 541 states. [2019-10-06 23:42:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:42:21,311 INFO L93 Difference]: Finished difference Result 594 states and 630 transitions. [2019-10-06 23:42:21,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 541 states. [2019-10-06 23:42:21,312 INFO L78 Accepts]: Start accepts. Automaton has 541 states. Word has length 508 [2019-10-06 23:42:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:42:21,315 INFO L225 Difference]: With dead ends: 594 [2019-10-06 23:42:21,315 INFO L226 Difference]: Without dead ends: 554 [2019-10-06 23:42:21,339 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2529 GetRequests, 1454 SyntacticMatches, 0 SemanticMatches, 1075 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194574 ImplicationChecksByTransitivity, 248.8s TimeCoverageRelationStatistics Valid=335488, Invalid=823364, Unknown=0, NotChecked=0, Total=1158852 [2019-10-06 23:42:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-06 23:42:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2019-10-06 23:42:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-06 23:42:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 547 transitions. [2019-10-06 23:42:21,373 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 547 transitions. Word has length 508 [2019-10-06 23:42:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:42:21,373 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 547 transitions. [2019-10-06 23:42:21,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 541 states. [2019-10-06 23:42:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 547 transitions. [2019-10-06 23:42:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-10-06 23:42:21,377 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:42:21,377 INFO L385 BasicCegarLoop]: trace histogram [467, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:42:21,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:42:21,581 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:42:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:42:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash -19982250, now seen corresponding path program 12 times [2019-10-06 23:42:21,582 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:42:21,582 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:42:21,583 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:21,583 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:42:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:42:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat