java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_running-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:15:42,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:15:42,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:15:42,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:15:42,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:15:42,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:15:42,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:15:42,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:15:42,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:15:42,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:15:42,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:15:42,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:15:42,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:15:42,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:15:42,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:15:42,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:15:42,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:15:42,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:15:42,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:15:42,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:15:42,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:15:42,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:15:42,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:15:42,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:15:42,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:15:42,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:15:42,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:15:42,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:15:42,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:15:42,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:15:42,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:15:42,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:15:42,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:15:42,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:15:42,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:15:42,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:15:42,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:15:42,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:15:42,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:15:42,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:15:42,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:15:42,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:15:42,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:15:42,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:15:42,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:15:42,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:15:42,450 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:15:42,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:15:42,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:15:42,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:15:42,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:15:42,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:15:42,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:15:42,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:15:42,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:15:42,452 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:15:42,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:15:42,452 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:15:42,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:15:42,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:15:42,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:15:42,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:15:42,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:15:42,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:15:42,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:15:42,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:15:42,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:15:42,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:15:42,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:15:42,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:15:42,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:15:42,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:15:42,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:15:42,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:15:42,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:15:42,750 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:15:42,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_running-1.i [2019-10-07 00:15:42,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4bd68b1/75dc3d4e6fb54b73900f77ab90c6c4dd/FLAG0e78c5904 [2019-10-07 00:15:43,312 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:15:43,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_running-1.i [2019-10-07 00:15:43,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4bd68b1/75dc3d4e6fb54b73900f77ab90c6c4dd/FLAG0e78c5904 [2019-10-07 00:15:43,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4bd68b1/75dc3d4e6fb54b73900f77ab90c6c4dd [2019-10-07 00:15:43,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:15:43,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:15:43,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:15:43,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:15:43,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:15:43,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:43,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ea0954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43, skipping insertion in model container [2019-10-07 00:15:43,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:43,695 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:15:43,710 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:15:43,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:15:43,907 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:15:43,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:15:43,950 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:15:43,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43 WrapperNode [2019-10-07 00:15:43,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:15:43,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:15:43,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:15:43,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:15:44,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:44,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:44,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:44,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:44,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:44,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:44,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... [2019-10-07 00:15:44,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:15:44,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:15:44,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:15:44,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:15:44,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:15:44,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:15:44,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:15:44,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:15:44,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:15:44,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:15:44,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:15:44,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:15:44,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:15:44,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:15:44,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:15:44,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:15:44,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:15:44,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:15:44,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:15:44,652 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:15:44,652 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:15:44,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:15:44 BoogieIcfgContainer [2019-10-07 00:15:44,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:15:44,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:15:44,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:15:44,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:15:44,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:15:43" (1/3) ... [2019-10-07 00:15:44,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6b6612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:15:44, skipping insertion in model container [2019-10-07 00:15:44,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:15:43" (2/3) ... [2019-10-07 00:15:44,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6b6612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:15:44, skipping insertion in model container [2019-10-07 00:15:44,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:15:44" (3/3) ... [2019-10-07 00:15:44,662 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_running-1.i [2019-10-07 00:15:44,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:15:44,680 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:15:44,692 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:15:44,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:15:44,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:15:44,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:15:44,719 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:15:44,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:15:44,720 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:15:44,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:15:44,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:15:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:15:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:15:44,742 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:44,743 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:44,745 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:44,751 INFO L82 PathProgramCache]: Analyzing trace with hash 945226407, now seen corresponding path program 1 times [2019-10-07 00:15:44,760 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:44,761 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:44,761 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:44,761 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:15:44,929 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:44,930 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:15:44,931 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:15:44,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:15:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:15:44,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:15:44,954 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:15:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:45,018 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-07 00:15:45,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:15:45,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:15:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:45,028 INFO L225 Difference]: With dead ends: 35 [2019-10-07 00:15:45,029 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 00:15:45,032 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:15:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 00:15:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-07 00:15:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 00:15:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-07 00:15:45,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-10-07 00:15:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:45,071 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-07 00:15:45,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:15:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-10-07 00:15:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:15:45,072 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:45,072 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:45,073 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1772269372, now seen corresponding path program 1 times [2019-10-07 00:15:45,074 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:45,074 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:45,074 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:45,074 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:15:45,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:45,171 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:45,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:15:45,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:15:45,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:15:45,344 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:45,370 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:45,370 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:45,378 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:45,387 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:45,388 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:45,584 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:46,485 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:46,514 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:46,522 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:46,523 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:46,523 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 209#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:46,524 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 214#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:46,525 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 223#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:46,525 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 219#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:46,525 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:15:46,526 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:46,526 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:46,526 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 228#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:46,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:46,527 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:46,528 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 204#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:15:46,529 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 199#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:15:46,529 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 194#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:15:46,772 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:46,773 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 9] total 15 [2019-10-07 00:15:46,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-07 00:15:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-07 00:15:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-10-07 00:15:46,779 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 15 states. [2019-10-07 00:15:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:47,539 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2019-10-07 00:15:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 00:15:47,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-10-07 00:15:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:47,541 INFO L225 Difference]: With dead ends: 34 [2019-10-07 00:15:47,541 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 00:15:47,544 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-10-07 00:15:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 00:15:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 00:15:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 00:15:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-07 00:15:47,551 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2019-10-07 00:15:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:47,551 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-07 00:15:47,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-07 00:15:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-07 00:15:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 00:15:47,553 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:47,553 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:47,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:47,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1883799143, now seen corresponding path program 2 times [2019-10-07 00:15:47,762 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:47,763 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:47,763 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:47,763 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:47,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:15:47,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:47,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:47,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:48,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:15:48,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:48,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:15:48,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:15:48,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 00:15:48,080 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:48,081 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:48,082 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:48,083 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:48,083 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:48,083 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:48,124 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:48,733 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:48,745 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:48,751 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:48,751 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:48,752 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 209#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:48,752 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 214#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:48,752 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 223#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:48,753 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 219#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:48,753 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:15:48,753 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:48,753 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:48,753 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 228#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:48,754 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:48,754 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:48,754 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 204#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:15:48,754 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 199#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:15:48,755 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 194#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:15:48,995 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:48,995 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-07 00:15:48,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 00:15:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 00:15:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-10-07 00:15:48,997 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 23 states. [2019-10-07 00:15:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:49,952 INFO L93 Difference]: Finished difference Result 58 states and 79 transitions. [2019-10-07 00:15:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 00:15:49,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-10-07 00:15:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:49,954 INFO L225 Difference]: With dead ends: 58 [2019-10-07 00:15:49,954 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 00:15:49,956 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=539, Invalid=1911, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 00:15:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 00:15:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-07 00:15:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-07 00:15:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-07 00:15:49,966 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 24 [2019-10-07 00:15:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:49,967 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-07 00:15:49,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 00:15:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-07 00:15:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 00:15:49,968 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:49,969 INFO L385 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:50,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:50,174 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:50,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1126640647, now seen corresponding path program 3 times [2019-10-07 00:15:50,176 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:50,176 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:50,176 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:50,177 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:15:50,495 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:50,495 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:50,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:50,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:15:50,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:15:50,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 00:15:50,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:15:50,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-07 00:15:50,883 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:50,884 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:50,884 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:50,885 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:50,885 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:50,885 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:50,914 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:51,350 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:51,360 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:51,364 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:51,365 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:51,365 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 211#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:51,365 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 216#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:51,367 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 225#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:51,368 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 221#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:51,370 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:15:51,370 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:51,371 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:51,371 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 230#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:51,371 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:51,375 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:51,375 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 206#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:15:51,376 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:15:51,376 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 196#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:15:51,638 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:51,638 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-07 00:15:51,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 00:15:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 00:15:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=860, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 00:15:51,642 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 35 states. [2019-10-07 00:15:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:15:53,960 INFO L93 Difference]: Finished difference Result 106 states and 145 transitions. [2019-10-07 00:15:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-07 00:15:53,968 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-10-07 00:15:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:15:53,969 INFO L225 Difference]: With dead ends: 106 [2019-10-07 00:15:53,970 INFO L226 Difference]: Without dead ends: 79 [2019-10-07 00:15:53,973 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1871, Invalid=5439, Unknown=0, NotChecked=0, Total=7310 [2019-10-07 00:15:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-07 00:15:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-07 00:15:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-07 00:15:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-10-07 00:15:53,988 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 42 [2019-10-07 00:15:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:15:53,989 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-10-07 00:15:53,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 00:15:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-10-07 00:15:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 00:15:53,991 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:15:53,991 INFO L385 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:15:54,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:54,196 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:15:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:15:54,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1289318585, now seen corresponding path program 4 times [2019-10-07 00:15:54,197 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:15:54,197 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:54,197 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:54,197 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:15:54,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:15:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:15:54,710 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:15:54,711 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:15:54,711 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:15:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:15:54,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 00:15:54,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:15:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:15:54,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:15:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-10-07 00:15:55,887 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:15:55,888 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:15:55,888 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:15:55,889 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:15:55,889 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:15:55,889 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:15:55,912 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:15:56,408 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:15:56,416 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:15:56,420 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:15:56,420 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:15:56,420 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:56,421 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 211#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:56,421 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 220#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:15:56,421 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 216#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:15:56,421 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:15:56,421 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:56,422 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:56,422 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 225#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:15:56,422 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:15:56,422 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:15:56,422 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:15:56,423 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 196#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:15:56,423 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 191#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:15:56,790 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:15:56,791 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-07 00:15:56,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-07 00:15:56,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-07 00:15:56,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1206, Invalid=2216, Unknown=0, NotChecked=0, Total=3422 [2019-10-07 00:15:56,801 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 59 states. [2019-10-07 00:16:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:16:02,830 INFO L93 Difference]: Finished difference Result 202 states and 277 transitions. [2019-10-07 00:16:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-10-07 00:16:02,835 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 78 [2019-10-07 00:16:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:16:02,837 INFO L225 Difference]: With dead ends: 202 [2019-10-07 00:16:02,837 INFO L226 Difference]: Without dead ends: 151 [2019-10-07 00:16:02,843 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6549 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7127, Invalid=17679, Unknown=0, NotChecked=0, Total=24806 [2019-10-07 00:16:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-07 00:16:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-10-07 00:16:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-07 00:16:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2019-10-07 00:16:02,865 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 78 [2019-10-07 00:16:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:16:02,866 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2019-10-07 00:16:02,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-07 00:16:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2019-10-07 00:16:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-07 00:16:02,869 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:16:02,869 INFO L385 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:16:03,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:16:03,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:16:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:16:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1805290041, now seen corresponding path program 5 times [2019-10-07 00:16:03,077 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:16:03,077 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:03,077 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:03,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:16:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:16:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:16:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 00:16:04,378 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:16:04,378 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:16:04,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:47,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 00:28:47,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:47,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 00:28:47,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 00:28:47,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2019-10-07 00:28:49,747 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:49,748 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:49,748 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:49,749 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:49,749 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:49,749 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:49,771 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:50,165 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:28:50,199 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:50,202 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:50,202 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:50,202 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 211#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:50,202 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 216#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:50,203 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 225#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:50,203 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 221#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:50,203 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:28:50,203 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:50,203 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 00:28:50,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 230#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:50,209 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:50,210 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:28:50,210 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 206#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:28:50,210 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:28:50,211 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 196#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:28:50,653 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:50,654 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 11] total 107 [2019-10-07 00:28:50,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-07 00:28:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-07 00:28:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4686, Invalid=6656, Unknown=0, NotChecked=0, Total=11342 [2019-10-07 00:28:50,660 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 107 states. [2019-10-07 00:29:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:07,863 INFO L93 Difference]: Finished difference Result 394 states and 541 transitions. [2019-10-07 00:29:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-10-07 00:29:07,863 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 150 [2019-10-07 00:29:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:07,865 INFO L225 Difference]: With dead ends: 394 [2019-10-07 00:29:07,865 INFO L226 Difference]: Without dead ends: 295 [2019-10-07 00:29:07,904 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23493 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=28007, Invalid=62895, Unknown=0, NotChecked=0, Total=90902 [2019-10-07 00:29:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-07 00:29:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-07 00:29:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-07 00:29:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2019-10-07 00:29:07,940 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 150 [2019-10-07 00:29:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:07,941 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2019-10-07 00:29:07,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-07 00:29:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2019-10-07 00:29:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-07 00:29:07,947 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:07,947 INFO L385 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:08,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:08,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:08,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:08,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1235468999, now seen corresponding path program 6 times [2019-10-07 00:29:08,163 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:08,163 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:08,164 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:08,164 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 00:29:15,779 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:15,779 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:15,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:16,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:29:16,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:16,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1846 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 00:29:16,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 00:29:16,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13395 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2019-10-07 00:29:26,364 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:26,365 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:26,365 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:26,366 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:26,366 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:26,366 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:26,389 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:26,828 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 00:29:26,835 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:26,839 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:26,839 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:26,839 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 209#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 214#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 223#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 219#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 135#(<= 0 main_~i~0) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 228#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:26,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:26,841 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-07 00:29:26,841 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 204#(and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-07 00:29:26,841 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 199#(and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= 0 main_~f~0)) [2019-10-07 00:29:26,841 INFO L193 IcfgInterpreter]: Reachable states at location L23-2 satisfy 194#(or (and (<= 0 main_~i~0) (<= main_~f~0 1) (<= 0 main_~f~0)) (and (<= 0 main_~i~0) (<= main_~f~0 1) (= main_~f~0 1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~f~0))) [2019-10-07 00:29:27,435 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:27,436 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 11] total 203 [2019-10-07 00:29:27,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 203 states [2019-10-07 00:29:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2019-10-07 00:29:27,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18558, Invalid=22448, Unknown=0, NotChecked=0, Total=41006 [2019-10-07 00:29:27,443 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 203 states.