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/sorting_selectionsort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:27:24,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:27:24,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:27:24,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:27:24,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:27:24,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:27:24,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:27:24,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:27:24,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:27:24,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:27:24,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:27:24,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:27:24,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:27:24,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:27:24,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:27:24,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:27:24,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:27:24,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:27:24,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:27:24,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:27:24,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:27:24,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:27:24,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:27:24,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:27:24,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:27:24,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:27:24,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:27:24,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:27:24,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:27:24,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:27:24,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:27:24,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:27:24,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:27:24,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:27:24,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:27:24,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:27:24,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:27:24,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:27:24,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:27:24,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:27:24,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:27:24,494 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:27:24,507 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:27:24,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:27:24,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:27:24,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:27:24,509 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:27:24,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:27:24,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:27:24,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:27:24,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:27:24,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:27:24,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:27:24,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:27:24,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:27:24,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:27:24,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:27:24,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:27:24,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:27:24,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:27:24,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:27:24,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:27:24,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:27:24,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:27:24,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:27:24,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:27:24,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:27:24,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:27:24,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:27:24,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:27:24,514 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:27:24,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:27:24,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:27:24,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:27:24,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:27:24,840 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:27:24,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-06 23:27:24,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7aa53495/8a29c8f02b2c4c2dacbc9c18ebcc8fc5/FLAG86c10684f [2019-10-06 23:27:25,365 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:27:25,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-06 23:27:25,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7aa53495/8a29c8f02b2c4c2dacbc9c18ebcc8fc5/FLAG86c10684f [2019-10-06 23:27:25,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7aa53495/8a29c8f02b2c4c2dacbc9c18ebcc8fc5 [2019-10-06 23:27:25,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:27:25,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:27:25,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:27:25,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:27:25,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:27:25,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:27:25" (1/1) ... [2019-10-06 23:27:25,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2066fc94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:25, skipping insertion in model container [2019-10-06 23:27:25,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:27:25" (1/1) ... [2019-10-06 23:27:25,759 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:27:25,777 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:27:25,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:27:25,969 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:27:26,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:27:26,023 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:27:26,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26 WrapperNode [2019-10-06 23:27:26,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:27:26,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:27:26,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:27:26,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:27:26,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (1/1) ... [2019-10-06 23:27:26,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (1/1) ... [2019-10-06 23:27:26,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (1/1) ... [2019-10-06 23:27:26,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (1/1) ... [2019-10-06 23:27:26,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (1/1) ... [2019-10-06 23:27:26,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (1/1) ... [2019-10-06 23:27:26,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (1/1) ... [2019-10-06 23:27:26,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:27:26,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:27:26,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:27:26,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:27:26,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (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:27:26,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:27:26,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:27:26,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:27:26,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:27:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:27:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:27:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:27:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:27:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:27:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:27:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:27:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:27:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:27:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:27:26,868 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:27:26,868 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-06 23:27:26,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:27:26 BoogieIcfgContainer [2019-10-06 23:27:26,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:27:26,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:27:26,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:27:26,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:27:26,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:27:25" (1/3) ... [2019-10-06 23:27:26,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2781c56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:27:26, skipping insertion in model container [2019-10-06 23:27:26,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:27:26" (2/3) ... [2019-10-06 23:27:26,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2781c56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:27:26, skipping insertion in model container [2019-10-06 23:27:26,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:27:26" (3/3) ... [2019-10-06 23:27:26,881 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_ground-2.i [2019-10-06 23:27:26,889 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:27:26,896 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:27:26,907 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:27:26,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:27:26,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:27:26,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:27:26,934 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:27:26,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:27:26,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:27:26,935 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:27:26,935 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:27:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-06 23:27:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:27:26,960 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:26,961 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:26,964 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1973278226, now seen corresponding path program 1 times [2019-10-06 23:27:26,979 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:26,979 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:26,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:26,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:27,141 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:27:27,142 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:27,142 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:27:27,143 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:27:27,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:27:27,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:27:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:27:27,159 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-10-06 23:27:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:27,206 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2019-10-06 23:27:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:27:27,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:27:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:27,217 INFO L225 Difference]: With dead ends: 51 [2019-10-06 23:27:27,218 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:27:27,221 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:27:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:27:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-06 23:27:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-06 23:27:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-10-06 23:27:27,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 13 [2019-10-06 23:27:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:27,265 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-06 23:27:27,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:27:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-10-06 23:27:27,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:27:27,266 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:27,267 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:27,267 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1107315554, now seen corresponding path program 1 times [2019-10-06 23:27:27,268 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:27,268 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:27,268 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:27,268 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:27,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:27,309 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:27:27,310 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:27,310 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:27:27,311 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:27:27,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:27:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:27:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:27:27,313 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 3 states. [2019-10-06 23:27:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:27,391 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2019-10-06 23:27:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:27:27,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:27:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:27,396 INFO L225 Difference]: With dead ends: 45 [2019-10-06 23:27:27,396 INFO L226 Difference]: Without dead ends: 35 [2019-10-06 23:27:27,397 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:27:27,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-06 23:27:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-06 23:27:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-06 23:27:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-06 23:27:27,419 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 14 [2019-10-06 23:27:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:27,420 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-06 23:27:27,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:27:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2019-10-06 23:27:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:27:27,422 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:27,422 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:27,423 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1470921508, now seen corresponding path program 1 times [2019-10-06 23:27:27,423 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:27,424 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:27,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:27,425 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:27:27,546 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:27,546 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:27,547 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:27:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:27,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:27:27,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:27:27,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:27:27,677 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:27,701 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:27:27,702 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:27,708 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:27,716 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:27,716 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:27,909 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:28,143 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-06 23:27:28,152 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:28,170 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:28,170 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:28,171 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 103#false [2019-10-06 23:27:28,171 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 88#false [2019-10-06 23:27:28,171 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 108#false [2019-10-06 23:27:28,172 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 117#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:28,173 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:28,173 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 93#false [2019-10-06 23:27:28,173 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:27:28,174 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:27:28,174 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 122#(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:27:28,175 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:28,175 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 83#false [2019-10-06 23:27:28,177 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 78#(and (< main_~i~0 100000) (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 0 main_~s~0) (= main_~k~0 (+ main_~i~0 1)) (<= 100000 main_~i~1) (<= main_~k~0 1) (= main_~i~0 main_~s~0) (<= main_~i~0 0) (<= main_~s~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:28,177 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:28,178 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 98#false [2019-10-06 23:27:28,178 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 113#false [2019-10-06 23:27:28,371 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:27:28,372 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 13 [2019-10-06 23:27:28,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-06 23:27:28,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-06 23:27:28,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-06 23:27:28,374 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 8 states. [2019-10-06 23:27:28,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:28,673 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2019-10-06 23:27:28,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-06 23:27:28,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-06 23:27:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:28,676 INFO L225 Difference]: With dead ends: 55 [2019-10-06 23:27:28,676 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:27:28,677 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-06 23:27:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:27:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-10-06 23:27:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:27:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-10-06 23:27:28,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 15 [2019-10-06 23:27:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:28,693 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-06 23:27:28,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-06 23:27:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2019-10-06 23:27:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:27:28,695 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:28,695 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:28,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:28,900 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:28,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1528376143, now seen corresponding path program 1 times [2019-10-06 23:27:28,901 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:28,901 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:28,902 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:28,902 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:28,980 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:27:28,980 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:28,980 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:27:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:29,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:27:29,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:29,045 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:27:29,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:29,070 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:27:29,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:29,072 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:27:29,072 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:29,073 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:29,073 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:29,073 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:29,140 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:29,450 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2019-10-06 23:27:29,464 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:29,471 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:29,472 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:29,472 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 135#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:27:29,472 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 117#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:29,472 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 140#false [2019-10-06 23:27:29,473 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 149#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:29,473 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:29,473 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 125#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:29,473 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:27:29,474 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:27:29,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 154#(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:27:29,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:29,474 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:29,474 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:29,475 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:29,475 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 130#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:29,475 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 145#false [2019-10-06 23:27:29,754 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:27:29,754 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 4, 4] total 18 [2019-10-06 23:27:29,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-06 23:27:29,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-06 23:27:29,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:27:29,756 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 11 states. [2019-10-06 23:27:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:30,115 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2019-10-06 23:27:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-06 23:27:30,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-10-06 23:27:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:30,117 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:27:30,118 INFO L226 Difference]: Without dead ends: 40 [2019-10-06 23:27:30,119 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:27:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-06 23:27:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-10-06 23:27:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:27:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-10-06 23:27:30,135 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2019-10-06 23:27:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:30,135 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-10-06 23:27:30,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-06 23:27:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-10-06 23:27:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-06 23:27:30,142 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:30,142 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:30,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:30,349 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:30,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2138333176, now seen corresponding path program 1 times [2019-10-06 23:27:30,351 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:30,351 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:30,352 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:30,352 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:27:30,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:30,414 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:27:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:30,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:27:30,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:27:30,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:27:30,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:30,521 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:27:30,521 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:30,522 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:30,522 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:30,522 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:30,551 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:30,865 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:27:30,906 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:30,911 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:30,911 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:30,911 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:27:30,912 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:27:30,912 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:30,912 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:30,912 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:30,913 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:30,913 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:30,913 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:30,913 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:27:30,914 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:27:30,914 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:27:30,914 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:30,914 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:30,914 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:30,915 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:30,915 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:27:30,915 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:30,916 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:31,449 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:31,449 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 14] total 22 [2019-10-06 23:27:31,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-06 23:27:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-06 23:27:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-10-06 23:27:31,451 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 22 states. [2019-10-06 23:27:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:32,212 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2019-10-06 23:27:32,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:27:32,213 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-10-06 23:27:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:32,214 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:27:32,214 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:27:32,216 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:27:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:27:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-10-06 23:27:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-06 23:27:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-10-06 23:27:32,225 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 23 [2019-10-06 23:27:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:32,226 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-10-06 23:27:32,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-06 23:27:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-10-06 23:27:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:27:32,227 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:32,227 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:32,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:32,431 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:32,432 INFO L82 PathProgramCache]: Analyzing trace with hash 17647327, now seen corresponding path program 2 times [2019-10-06 23:27:32,432 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:32,432 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:32,433 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:32,433 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:27:32,522 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:32,522 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:32,522 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 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:27:32,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:27:32,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:27:32,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-06 23:27:32,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-06 23:27:32,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:27:32,700 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:32,701 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:27:32,702 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:32,702 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:32,702 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:32,703 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:32,732 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:32,959 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:27:32,979 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:32,982 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:32,983 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:32,983 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:27:32,986 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:27:32,986 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:32,986 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:32,987 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:32,987 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:32,987 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:32,987 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:32,987 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:27:32,988 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:27:32,988 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:27:32,989 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:32,990 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:32,990 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:32,990 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:32,990 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:27:32,991 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:32,991 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:33,553 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:33,553 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 14] total 28 [2019-10-06 23:27:33,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:27:33,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:27:33,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:27:33,555 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 28 states. [2019-10-06 23:27:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:34,858 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2019-10-06 23:27:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:27:34,858 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-10-06 23:27:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:34,871 INFO L225 Difference]: With dead ends: 91 [2019-10-06 23:27:34,871 INFO L226 Difference]: Without dead ends: 61 [2019-10-06 23:27:34,872 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=440, Invalid=2530, Unknown=0, NotChecked=0, Total=2970 [2019-10-06 23:27:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-06 23:27:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-10-06 23:27:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-06 23:27:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-10-06 23:27:34,895 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2019-10-06 23:27:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:34,896 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-10-06 23:27:34,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:27:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-10-06 23:27:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:27:34,897 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:34,897 INFO L385 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:35,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:35,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:35,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1410067541, now seen corresponding path program 3 times [2019-10-06 23:27:35,103 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:35,103 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:35,104 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:35,104 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:27:35,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:35,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:35,209 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 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:27:35,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:27:35,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:27:35,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:27:35,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:27:35,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:27:35,385 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:35,387 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:27:35,390 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:35,391 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:35,391 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:35,391 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:35,412 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:35,605 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:27:35,617 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:35,620 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:35,620 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:35,621 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:27:35,621 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:27:35,621 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:35,621 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:35,622 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:35,622 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:35,622 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:35,622 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:35,623 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:27:35,626 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:27:35,627 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:27:35,627 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:35,627 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:35,630 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:35,631 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:35,631 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:27:35,631 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:35,631 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:36,107 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:36,107 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 14] total 28 [2019-10-06 23:27:36,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:27:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:27:36,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:27:36,110 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 28 states. [2019-10-06 23:27:37,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:37,047 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2019-10-06 23:27:37,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:27:37,048 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-10-06 23:27:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:37,049 INFO L225 Difference]: With dead ends: 101 [2019-10-06 23:27:37,049 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:27:37,052 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=428, Invalid=2122, Unknown=0, NotChecked=0, Total=2550 [2019-10-06 23:27:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:27:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-06 23:27:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-06 23:27:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2019-10-06 23:27:37,063 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 32 [2019-10-06 23:27:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:37,063 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2019-10-06 23:27:37,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:27:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2019-10-06 23:27:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:27:37,064 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:37,065 INFO L385 BasicCegarLoop]: trace histogram [12, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:37,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:37,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1222392289, now seen corresponding path program 4 times [2019-10-06 23:27:37,270 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:37,270 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:37,270 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:37,271 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:27:37,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:37,409 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:37,409 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 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:27:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:37,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:27:37,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:27:37,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:27:37,774 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:37,776 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:27:37,776 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:37,776 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:37,777 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:37,777 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:37,801 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:37,970 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:27:37,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:37,993 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:37,993 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:37,994 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:27:37,994 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:27:37,994 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:37,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:37,994 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:37,995 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:37,995 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:37,995 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:37,995 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:27:37,995 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:27:37,995 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:27:37,996 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:37,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:37,997 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:37,997 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:37,997 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:27:37,997 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:37,998 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:38,533 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:38,533 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 14] total 42 [2019-10-06 23:27:38,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-06 23:27:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-06 23:27:38,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1273, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:27:38,536 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 42 states. [2019-10-06 23:27:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:39,968 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2019-10-06 23:27:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-06 23:27:39,969 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 39 [2019-10-06 23:27:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:39,970 INFO L225 Difference]: With dead ends: 115 [2019-10-06 23:27:39,970 INFO L226 Difference]: Without dead ends: 74 [2019-10-06 23:27:39,974 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1303, Invalid=4859, Unknown=0, NotChecked=0, Total=6162 [2019-10-06 23:27:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-06 23:27:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-06 23:27:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-06 23:27:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-10-06 23:27:39,984 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 39 [2019-10-06 23:27:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:39,984 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-10-06 23:27:39,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-06 23:27:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-10-06 23:27:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-06 23:27:39,986 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:39,986 INFO L385 BasicCegarLoop]: trace histogram [26, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:40,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:40,190 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:40,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1064533857, now seen corresponding path program 5 times [2019-10-06 23:27:40,191 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:40,192 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:40,192 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:40,192 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 2 proven. 351 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:27:40,597 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:40,601 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:40,601 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 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:27:40,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:27:40,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:27:40,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-06 23:27:40,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-10-06 23:27:40,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:41,029 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-10-06 23:27:41,030 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:41,031 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:27:41,031 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:41,032 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:41,032 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:41,032 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:41,050 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:41,200 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:27:41,211 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:41,214 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:41,214 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:41,214 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:27:41,215 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:27:41,215 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:41,215 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:41,215 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:41,215 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:41,215 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:41,216 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:41,216 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:27:41,216 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:27:41,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:27:41,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:41,217 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:41,217 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:41,217 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:41,217 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:27:41,217 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:41,218 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:41,895 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:41,896 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 10, 14] total 58 [2019-10-06 23:27:41,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-06 23:27:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-06 23:27:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2723, Unknown=0, NotChecked=0, Total=3306 [2019-10-06 23:27:41,898 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 58 states. [2019-10-06 23:27:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:45,459 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2019-10-06 23:27:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-06 23:27:45,459 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 53 [2019-10-06 23:27:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:45,461 INFO L225 Difference]: With dead ends: 136 [2019-10-06 23:27:45,461 INFO L226 Difference]: Without dead ends: 95 [2019-10-06 23:27:45,466 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3604 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2145, Invalid=11897, Unknown=0, NotChecked=0, Total=14042 [2019-10-06 23:27:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-06 23:27:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2019-10-06 23:27:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-06 23:27:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-10-06 23:27:45,478 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 53 [2019-10-06 23:27:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:45,479 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-10-06 23:27:45,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-06 23:27:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-10-06 23:27:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-06 23:27:45,481 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:45,481 INFO L385 BasicCegarLoop]: trace histogram [27, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:45,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:45,690 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:45,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash 869018027, now seen corresponding path program 6 times [2019-10-06 23:27:45,691 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:45,691 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:45,691 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:45,692 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:27:46,136 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:46,136 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:46,137 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 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:27:46,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:27:46,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:27:46,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:27:46,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-06 23:27:46,318 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:27:47,219 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:47,220 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:27:47,220 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:47,221 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:47,221 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:47,221 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:47,241 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:47,429 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:27:47,443 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:47,446 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:47,446 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:47,446 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:27:47,446 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:27:47,447 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:47,447 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:47,447 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:47,447 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:47,447 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:47,448 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:47,448 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:27:47,448 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:27:47,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:27:47,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:47,448 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:47,449 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:47,449 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:47,449 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:27:47,449 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:47,449 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:48,030 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:48,031 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 14] total 72 [2019-10-06 23:27:48,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-06 23:27:48,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-06 23:27:48,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3358, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:27:48,034 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 72 states. [2019-10-06 23:27:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:51,283 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2019-10-06 23:27:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-06 23:27:51,284 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 62 [2019-10-06 23:27:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:51,285 INFO L225 Difference]: With dead ends: 169 [2019-10-06 23:27:51,286 INFO L226 Difference]: Without dead ends: 116 [2019-10-06 23:27:51,292 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4754 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5158, Invalid=14024, Unknown=0, NotChecked=0, Total=19182 [2019-10-06 23:27:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-06 23:27:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-10-06 23:27:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-06 23:27:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2019-10-06 23:27:51,307 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 62 [2019-10-06 23:27:51,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:51,307 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2019-10-06 23:27:51,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-06 23:27:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2019-10-06 23:27:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-06 23:27:51,309 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:51,309 INFO L385 BasicCegarLoop]: trace histogram [56, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:51,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:51,517 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1788151393, now seen corresponding path program 7 times [2019-10-06 23:27:51,518 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:51,518 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:51,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:51,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:51,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 2 proven. 1596 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:27:52,859 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:52,859 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:52,859 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 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:27:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:53,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:27:53,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-06 23:27:53,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:27:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 2 proven. 1596 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:27:56,482 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:27:56,483 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:27:56,483 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:27:56,501 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:27:56,501 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:27:56,501 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:27:56,519 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:27:56,670 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:27:56,698 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:27:56,701 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:27:56,701 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:27:56,701 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:27:56,701 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:27:56,702 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:56,702 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:27:56,702 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:56,702 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:56,702 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:27:56,702 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:56,703 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:27:56,703 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:27:56,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:27:56,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:27:56,703 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:27:56,703 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:27:56,703 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:27:56,704 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:27:56,704 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:27:56,704 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:27:57,566 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:27:57,566 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 14] total 130 [2019-10-06 23:27:57,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-10-06 23:27:57,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-10-06 23:27:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6829, Invalid=9941, Unknown=0, NotChecked=0, Total=16770 [2019-10-06 23:27:57,571 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 130 states. [2019-10-06 23:28:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:07,155 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2019-10-06 23:28:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-06 23:28:07,155 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 91 [2019-10-06 23:28:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:07,158 INFO L225 Difference]: With dead ends: 227 [2019-10-06 23:28:07,159 INFO L226 Difference]: Without dead ends: 174 [2019-10-06 23:28:07,164 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13686 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20267, Invalid=44503, Unknown=0, NotChecked=0, Total=64770 [2019-10-06 23:28:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-06 23:28:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-06 23:28:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-06 23:28:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2019-10-06 23:28:07,182 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 91 [2019-10-06 23:28:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:07,182 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2019-10-06 23:28:07,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-10-06 23:28:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2019-10-06 23:28:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-06 23:28:07,185 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:07,185 INFO L385 BasicCegarLoop]: trace histogram [114, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:07,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:07,390 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:07,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1910199583, now seen corresponding path program 8 times [2019-10-06 23:28:07,391 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:07,391 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:07,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:07,391 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6664 backedges. 2 proven. 6555 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:28:12,244 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:12,244 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:12,244 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 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:28:12,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-06 23:28:12,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:28:12,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-06 23:28:12,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6664 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6559 trivial. 0 not checked. [2019-10-06 23:28:13,342 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6664 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 6557 trivial. 0 not checked. [2019-10-06 23:28:14,339 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:14,340 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:28:14,340 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:14,341 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:14,341 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:14,341 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:14,361 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:14,507 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:28:14,523 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:14,525 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:14,525 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:14,526 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:28:14,526 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:28:14,526 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:28:14,526 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:14,526 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:28:14,526 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:14,527 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:28:14,527 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:14,527 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:28:14,527 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:28:14,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:28:14,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:14,528 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:14,528 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:28:14,528 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:28:14,528 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:28:14,528 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:28:14,528 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:28:15,866 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:15,866 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 18, 18, 14] total 162 [2019-10-06 23:28:15,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-10-06 23:28:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-10-06 23:28:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7339, Invalid=18743, Unknown=0, NotChecked=0, Total=26082 [2019-10-06 23:28:15,870 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand 162 states. [2019-10-06 23:28:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:28:34,270 INFO L93 Difference]: Finished difference Result 260 states and 314 transitions. [2019-10-06 23:28:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-10-06 23:28:34,271 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 149 [2019-10-06 23:28:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:28:34,275 INFO L225 Difference]: With dead ends: 260 [2019-10-06 23:28:34,275 INFO L226 Difference]: Without dead ends: 207 [2019-10-06 23:28:34,285 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24012 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=23377, Invalid=88513, Unknown=0, NotChecked=0, Total=111890 [2019-10-06 23:28:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-06 23:28:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 198. [2019-10-06 23:28:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-06 23:28:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 210 transitions. [2019-10-06 23:28:34,327 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 210 transitions. Word has length 149 [2019-10-06 23:28:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:28:34,329 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 210 transitions. [2019-10-06 23:28:34,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-10-06 23:28:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 210 transitions. [2019-10-06 23:28:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-06 23:28:34,341 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:28:34,341 INFO L385 BasicCegarLoop]: trace histogram [115, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:28:34,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:28:34,547 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:28:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:28:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1331153749, now seen corresponding path program 9 times [2019-10-06 23:28:34,548 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:28:34,549 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:34,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:34,549 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:28:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:28:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:28:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 2 proven. 6670 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:28:39,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:28:39,376 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:28:39,376 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 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:28:39,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:28:39,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:28:39,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:28:39,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:28:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-06 23:28:39,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 2 proven. 6670 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:28:53,643 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:53,645 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:28:53,645 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:53,645 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:53,645 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:53,646 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:53,672 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:53,823 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:28:53,834 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:53,837 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:53,838 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:53,838 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:28:53,838 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:28:53,838 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:28:53,838 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:53,838 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:28:53,838 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:53,838 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:28:53,839 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:53,839 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:28:53,839 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:28:53,839 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:28:53,839 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:53,839 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:53,839 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:28:53,839 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:28:53,839 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:28:53,840 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:28:53,840 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:28:55,104 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:55,105 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 14] total 248 [2019-10-06 23:28:55,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 248 states [2019-10-06 23:28:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2019-10-06 23:28:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27538, Invalid=33718, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:28:55,111 INFO L87 Difference]: Start difference. First operand 198 states and 210 transitions. Second operand 248 states. [2019-10-06 23:29:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:29:28,326 INFO L93 Difference]: Finished difference Result 393 states and 533 transitions. [2019-10-06 23:29:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2019-10-06 23:29:28,327 INFO L78 Accepts]: Start accepts. Automaton has 248 states. Word has length 166 [2019-10-06 23:29:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:29:28,329 INFO L225 Difference]: With dead ends: 393 [2019-10-06 23:29:28,329 INFO L226 Difference]: Without dead ends: 316 [2019-10-06 23:29:28,344 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44838 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=82158, Invalid=158432, Unknown=0, NotChecked=0, Total=240590 [2019-10-06 23:29:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-10-06 23:29:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2019-10-06 23:29:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-06 23:29:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 327 transitions. [2019-10-06 23:29:28,369 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 327 transitions. Word has length 166 [2019-10-06 23:29:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:29:28,370 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 327 transitions. [2019-10-06 23:29:28,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 248 states. [2019-10-06 23:29:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 327 transitions. [2019-10-06 23:29:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-06 23:29:28,373 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:29:28,374 INFO L385 BasicCegarLoop]: trace histogram [232, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:29:28,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:29:28,580 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:29:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:29:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1694442143, now seen corresponding path program 10 times [2019-10-06 23:29:28,580 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:29:28,581 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:29:28,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:29:28,581 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:29:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:29:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:29:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 27497 backedges. 2 proven. 27028 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:29:47,259 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:29:47,259 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:29:47,259 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:29:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:29:47,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:29:47,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:29:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27497 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-06 23:29:47,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 27497 backedges. 2 proven. 27028 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:30:44,582 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:44,583 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:30:44,583 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:44,583 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:44,584 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:44,584 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:44,616 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:44,763 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:30:44,782 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:44,785 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:44,785 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:44,785 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:30:44,785 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:30:44,786 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:30:44,786 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:44,786 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:30:44,786 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:30:44,786 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:30:44,786 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:30:44,786 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:44,786 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:44,787 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:44,787 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:44,787 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:30:44,787 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:30:44,787 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:30:44,787 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:30:44,788 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:30:44,788 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:30:46,887 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:46,888 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 14] total 482 [2019-10-06 23:30:46,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 482 states [2019-10-06 23:30:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 482 interpolants. [2019-10-06 23:30:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109789, Invalid=122053, Unknown=0, NotChecked=0, Total=231842 [2019-10-06 23:30:46,906 INFO L87 Difference]: Start difference. First operand 315 states and 327 transitions. Second operand 482 states. [2019-10-06 23:32:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:32:58,417 INFO L93 Difference]: Finished difference Result 627 states and 884 transitions. [2019-10-06 23:32:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 482 states. [2019-10-06 23:32:58,417 INFO L78 Accepts]: Start accepts. Automaton has 482 states. Word has length 283 [2019-10-06 23:32:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:32:58,421 INFO L225 Difference]: With dead ends: 627 [2019-10-06 23:32:58,421 INFO L226 Difference]: Without dead ends: 550 [2019-10-06 23:32:58,449 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1560 GetRequests, 601 SyntacticMatches, 2 SemanticMatches, 957 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158094 ImplicationChecksByTransitivity, 196.7s TimeCoverageRelationStatistics Valid=328443, Invalid=590279, Unknown=0, NotChecked=0, Total=918722 [2019-10-06 23:32:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-06 23:32:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2019-10-06 23:32:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-10-06 23:32:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 561 transitions. [2019-10-06 23:32:58,482 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 561 transitions. Word has length 283 [2019-10-06 23:32:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:32:58,482 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 561 transitions. [2019-10-06 23:32:58,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 482 states. [2019-10-06 23:32:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 561 transitions. [2019-10-06 23:32:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-10-06 23:32:58,492 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:32:58,492 INFO L385 BasicCegarLoop]: trace histogram [466, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:32:58,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:58,702 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:32:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:32:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1259602463, now seen corresponding path program 11 times [2019-10-06 23:32:58,702 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:32:58,702 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:58,702 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:58,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:34:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 109280 backedges. 2 proven. 108811 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:34:17,485 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:17,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:34:17,486 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:34:24,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-06 23:34:24,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:34:24,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-06 23:34:24,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:34:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 109280 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 108815 trivial. 0 not checked. [2019-10-06 23:34:31,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:34:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 109280 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 108813 trivial. 0 not checked. [2019-10-06 23:34:38,180 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:34:38,181 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:34:38,181 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:34:38,182 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:34:38,182 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:34:38,182 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:34:38,203 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:34:38,385 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:34:38,398 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:34:38,401 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:34:38,401 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:34:38,401 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:34:38,401 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (= main_~i~0 0) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:34:38,402 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:34:38,402 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:34:38,402 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:34:38,402 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:34:38,402 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:34:38,402 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:34:38,402 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:34:38,403 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:34:38,403 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:34:38,403 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:34:38,403 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:34:38,403 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:34:38,403 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:34:38,404 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:34:38,404 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:34:38,404 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:34:42,673 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:34:42,674 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 34, 34, 14] total 546 [2019-10-06 23:34:42,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 546 states [2019-10-06 23:34:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 546 interpolants. [2019-10-06 23:34:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111819, Invalid=185751, Unknown=0, NotChecked=0, Total=297570 [2019-10-06 23:34:42,698 INFO L87 Difference]: Start difference. First operand 549 states and 561 transitions. Second operand 546 states. [2019-10-06 23:38:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:01,143 INFO L93 Difference]: Finished difference Result 684 states and 762 transitions. [2019-10-06 23:38:01,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 578 states. [2019-10-06 23:38:01,143 INFO L78 Accepts]: Start accepts. Automaton has 546 states. Word has length 517 [2019-10-06 23:38:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:01,147 INFO L225 Difference]: With dead ends: 684 [2019-10-06 23:38:01,148 INFO L226 Difference]: Without dead ends: 607 [2019-10-06 23:38:01,183 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2592 GetRequests, 1473 SyntacticMatches, 2 SemanticMatches, 1117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221204 ImplicationChecksByTransitivity, 274.2s TimeCoverageRelationStatistics Valid=340409, Invalid=910633, Unknown=0, NotChecked=0, Total=1251042 [2019-10-06 23:38:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-06 23:38:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 598. [2019-10-06 23:38:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-06 23:38:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 610 transitions. [2019-10-06 23:38:01,221 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 610 transitions. Word has length 517 [2019-10-06 23:38:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:01,222 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 610 transitions. [2019-10-06 23:38:01,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 546 states. [2019-10-06 23:38:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 610 transitions. [2019-10-06 23:38:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2019-10-06 23:38:01,234 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:01,234 INFO L385 BasicCegarLoop]: trace histogram [467, 62, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:01,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:01,443 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash -69974357, now seen corresponding path program 12 times [2019-10-06 23:38:01,444 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:01,444 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:01,444 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:01,444 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:39:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 111235 backedges. 2 proven. 109278 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2019-10-06 23:39:20,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:39:20,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:39:20,131 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:39:20,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:39:20,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:39:21,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 3133 conjuncts, 469 conjunts are in the unsatisfiable core [2019-10-06 23:39:21,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:39:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 111235 backedges. 0 proven. 109278 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2019-10-06 23:39:21,286 INFO L322 TraceCheckSpWp]: Computing backward predicates...