java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:59:04,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:59:04,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:59:04,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:59:04,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:59:04,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:59:04,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:59:04,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:59:04,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:59:04,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:59:04,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:59:04,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:59:04,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:59:04,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:59:04,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:59:04,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:59:04,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:59:04,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:59:04,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:59:04,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:59:04,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:59:04,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:59:04,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:59:04,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:59:04,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:59:04,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:59:04,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:59:04,346 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:59:04,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:59:04,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:59:04,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:59:04,347 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-24 19:59:04,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:59:04,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:59:04,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:59:04,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:59:04,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:59:04,359 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:59:04,359 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:59:04,359 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:59:04,359 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:59:04,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:59:04,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:59:04,360 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:59:04,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:59:04,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:59:04,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:59:04,361 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:59:04,361 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:59:04,361 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:59:04,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:59:04,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:59:04,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:59:04,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:59:04,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:59:04,362 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:59:04,363 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:59:04,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:59:04,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:59:04,363 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:59:04,363 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:59:04,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:59:04,364 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:59:04,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:59:04,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:59:04,364 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:59:04,364 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:59:04,365 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:59:04,365 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:59:04,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:59:04,414 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:59:04,418 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:59:04,420 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:59:04,421 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:59:04,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:59:04,583 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:59:04,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:59:04,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:59:04,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:59:04,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:59:04,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f959c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04, skipping insertion in model container [2018-01-24 19:59:04,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,622 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:59:04,662 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:59:04,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:59:04,796 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:59:04,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04 WrapperNode [2018-01-24 19:59:04,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:59:04,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:59:04,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:59:04,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:59:04,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... [2018-01-24 19:59:04,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:59:04,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:59:04,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:59:04,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:59:04,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (1/1) ... No working directory specified, using /storage/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 [2018-01-24 19:59:04,892 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:59:04,892 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:59:04,893 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-01-24 19:59:04,893 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:59:04,893 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:59:04,893 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:59:04,893 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:59:04,893 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:59:04,893 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:59:04,893 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:59:04,893 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-01-24 19:59:04,894 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:59:04,894 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:59:04,894 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:59:05,055 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:59:05,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:59:05 BoogieIcfgContainer [2018-01-24 19:59:05,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:59:05,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:59:05,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:59:05,059 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:59:05,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:59:04" (1/3) ... [2018-01-24 19:59:05,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca2d8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:59:05, skipping insertion in model container [2018-01-24 19:59:05,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:59:04" (2/3) ... [2018-01-24 19:59:05,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca2d8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:59:05, skipping insertion in model container [2018-01-24 19:59:05,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:59:05" (3/3) ... [2018-01-24 19:59:05,064 INFO L105 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:59:05,073 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:59:05,081 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 19:59:05,127 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:59:05,127 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:59:05,127 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:59:05,127 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:59:05,127 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:59:05,127 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:59:05,128 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:59:05,128 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:59:05,128 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:59:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 19:59:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 19:59:05,148 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:05,151 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:05,151 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash -407257815, now seen corresponding path program 1 times [2018-01-24 19:59:05,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:05,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:05,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:05,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:05,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:59:05,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:59:05,443 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:59:05,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:59:05,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:59:05,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:59:05,463 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-01-24 19:59:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:05,636 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-01-24 19:59:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:59:05,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 19:59:05,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:05,650 INFO L225 Difference]: With dead ends: 30 [2018-01-24 19:59:05,650 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 19:59:05,654 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:59:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 19:59:05,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 19:59:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 19:59:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-01-24 19:59:05,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-01-24 19:59:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:05,699 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-01-24 19:59:05,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:59:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-01-24 19:59:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 19:59:05,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:05,700 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:05,701 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:05,701 INFO L82 PathProgramCache]: Analyzing trace with hash -407257816, now seen corresponding path program 1 times [2018-01-24 19:59:05,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:05,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:05,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,703 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:05,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:05,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:59:05,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:59:05,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:59:05,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:59:05,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:59:05,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:59:05,749 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-01-24 19:59:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:05,794 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-01-24 19:59:05,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:59:05,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 19:59:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:05,795 INFO L225 Difference]: With dead ends: 26 [2018-01-24 19:59:05,796 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 19:59:05,797 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:59:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 19:59:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 19:59:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 19:59:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-24 19:59:05,802 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2018-01-24 19:59:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:05,803 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-24 19:59:05,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:59:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-24 19:59:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:59:05,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:05,804 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:05,804 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:05,804 INFO L82 PathProgramCache]: Analyzing trace with hash 665022209, now seen corresponding path program 1 times [2018-01-24 19:59:05,805 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:05,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:05,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,806 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:05,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:05,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:59:05,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:59:05,880 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:59:05,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:59:05,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:59:05,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:59:05,881 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-01-24 19:59:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:05,945 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-01-24 19:59:05,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:59:05,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 19:59:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:05,946 INFO L225 Difference]: With dead ends: 25 [2018-01-24 19:59:05,947 INFO L226 Difference]: Without dead ends: 24 [2018-01-24 19:59:05,947 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:59:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-24 19:59:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-24 19:59:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-24 19:59:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-01-24 19:59:05,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-01-24 19:59:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:05,953 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-01-24 19:59:05,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:59:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-01-24 19:59:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:59:05,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:05,954 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:05,955 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:05,955 INFO L82 PathProgramCache]: Analyzing trace with hash 665022210, now seen corresponding path program 1 times [2018-01-24 19:59:05,955 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:05,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:05,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:05,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:05,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:06,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:59:06,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:59:06,085 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:59:06,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:59:06,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:59:06,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:59:06,086 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-01-24 19:59:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:06,182 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-01-24 19:59:06,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:59:06,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-01-24 19:59:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:06,184 INFO L225 Difference]: With dead ends: 32 [2018-01-24 19:59:06,184 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 19:59:06,184 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:59:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 19:59:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 19:59:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 19:59:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 19:59:06,189 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2018-01-24 19:59:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:06,189 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 19:59:06,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:59:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 19:59:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 19:59:06,190 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:06,190 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:06,190 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1167971539, now seen corresponding path program 1 times [2018-01-24 19:59:06,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:06,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:06,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:06,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:06,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:06,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:06,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:59:06,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 19:59:06,351 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:59:06,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:59:06,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:59:06,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:59:06,352 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-01-24 19:59:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:06,570 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-24 19:59:06,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:59:06,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 19:59:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:06,571 INFO L225 Difference]: With dead ends: 62 [2018-01-24 19:59:06,571 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 19:59:06,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-24 19:59:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 19:59:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-01-24 19:59:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 19:59:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 19:59:06,582 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 17 [2018-01-24 19:59:06,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:06,583 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 19:59:06,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:59:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 19:59:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 19:59:06,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:06,584 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:06,584 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:06,584 INFO L82 PathProgramCache]: Analyzing trace with hash -466906961, now seen corresponding path program 1 times [2018-01-24 19:59:06,585 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:06,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:06,586 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:06,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:06,586 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:06,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:06,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:59:06,795 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:59:06,800 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-01-24 19:59:06,801 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [14], [23], [24], [26], [30], [34], [35], [36], [38], [40] [2018-01-24 19:59:06,844 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:59:06,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:59:11,478 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:59:11,480 INFO L268 AbstractInterpreter]: Visited 16 different actions 31 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 16 variables. [2018-01-24 19:59:11,510 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:59:11,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:59:11,510 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:59:11,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:11,524 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:59:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:11,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:59:11,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 19:59:11,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 19:59:11,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:11,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:11,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 19:59:11,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:59:11,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 19:59:11,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 19:59:11,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:59:11,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:11,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:11,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 19:59:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:11,974 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:59:12,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 19:59:12,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 19:59:12,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:59:12,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:59:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:12,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:59:12,278 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:59:12,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:12,282 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:59:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:12,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:59:12,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 19:59:12,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:59:12,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 19:59:12,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 19:59:12,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:59:12,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 19:59:12,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-01-24 19:59:12,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:59:12,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:12,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:12,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-24 19:59:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:12,636 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:59:12,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 19:59:12,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:59:12,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:12,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:59:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:12,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:59:12,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 34 [2018-01-24 19:59:12,782 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:59:12,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 19:59:12,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 19:59:12,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 19:59:12,784 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 17 states. [2018-01-24 19:59:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:13,239 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 19:59:13,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 19:59:13,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-01-24 19:59:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:13,272 INFO L225 Difference]: With dead ends: 50 [2018-01-24 19:59:13,272 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:59:13,273 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 19:59:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:59:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-01-24 19:59:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 19:59:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 19:59:13,282 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-01-24 19:59:13,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:13,283 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 19:59:13,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 19:59:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 19:59:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 19:59:13,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:13,284 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:13,284 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -847794598, now seen corresponding path program 2 times [2018-01-24 19:59:13,285 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:13,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:13,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:59:13,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:13,286 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:13,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:13,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:59:13,613 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:59:13,613 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 19:59:13,613 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:59:13,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:59:13,614 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:59:13,620 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 19:59:13,620 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 19:59:13,629 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:59:13,634 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:59:13,636 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:59:13,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:59:13,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 19:59:13,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 19:59:13,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:13,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:13,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 19:59:13,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:59:14,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-24 19:59:14,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 19:59:14,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-24 19:59:14,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:59:14,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:14,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:14,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:43 [2018-01-24 19:59:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:14,496 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:59:14,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 19:59:14,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:14,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-01-24 19:59:14,941 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:59:14,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 19:59:14,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:14,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:14,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:14,955 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:10 [2018-01-24 19:59:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:14,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:59:14,990 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:59:14,993 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 19:59:14,993 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 19:59:15,004 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:59:15,015 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:59:15,027 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:59:15,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:59:15,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 19:59:15,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:15,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:15,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 19:59:15,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:59:15,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 19:59:15,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:15,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:15,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:15,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 19:59:15,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 19:59:15,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:59:15,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:59:15,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:15,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:15,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 19:59:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:15,307 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:59:15,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 19:59:15,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:59:15,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:59:15,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:59:15,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:59:15,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 19:59:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:15,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:59:15,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 13, 13] total 46 [2018-01-24 19:59:15,721 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:59:15,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 19:59:15,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 19:59:15,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2005, Unknown=1, NotChecked=0, Total=2162 [2018-01-24 19:59:15,723 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 22 states. [2018-01-24 19:59:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:30,424 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-24 19:59:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 19:59:30,424 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-01-24 19:59:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:30,426 INFO L225 Difference]: With dead ends: 62 [2018-01-24 19:59:30,426 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 19:59:30,427 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=470, Invalid=3951, Unknown=1, NotChecked=0, Total=4422 [2018-01-24 19:59:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 19:59:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-01-24 19:59:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 19:59:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 19:59:30,436 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 21 [2018-01-24 19:59:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:30,437 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 19:59:30,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 19:59:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 19:59:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:59:30,438 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:59:30,438 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:59:30,438 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 19:59:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1711563014, now seen corresponding path program 1 times [2018-01-24 19:59:30,439 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:59:30,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:30,439 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 19:59:30,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:59:30,440 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:59:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:59:30,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:59:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:59:30,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:59:30,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:59:30,484 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:59:30,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:59:30,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:59:30,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:59:30,485 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-01-24 19:59:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:59:30,516 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 19:59:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:59:30,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 19:59:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:59:30,517 INFO L225 Difference]: With dead ends: 46 [2018-01-24 19:59:30,517 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 19:59:30,517 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:59:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 19:59:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 19:59:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 19:59:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 19:59:30,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-24 19:59:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:59:30,518 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 19:59:30,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:59:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 19:59:30,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 19:59:30,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 19:59:31,242 WARN L146 SmtUtils]: Spent 626ms on a formula simplification. DAG size of input: 130 DAG size of output 93 [2018-01-24 19:59:31,315 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,315 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 19:59:31,315 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,315 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 554) the Hoare annotation is: true [2018-01-24 19:59:31,315 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 554) the Hoare annotation is: true [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L397 ceAbstractionStarter]: At program point L552'(line 552) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~3.base))) (and (= main_~length1~3 .cse0) (= 1 (select |#valid| |main_#t~malloc3.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (= 1 (select |#valid| main_~nondetString1~3.base)) (= 0 |main_#t~malloc3.offset|) (exists ((main_~length1~3 Int)) (and (<= (+ main_~length1~3 main_~nondetString1~3.offset) (select |#length| main_~nondetString1~3.base)) (<= 1 main_~length1~3) (= 0 (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~length1~3 main_~nondetString1~3.offset (- 1)))))) (= 0 main_~nondetString1~3.offset) (let ((.cse1 (+ main_~nondetString1~3.offset .cse0))) (or (= 0 (select (select |#memory_int| main_~nondetString1~3.base) 1)) (<= 3 .cse1) (<= .cse1 1))) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|)))) [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 546 554) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 554) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,316 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 546 554) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 546 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point strlen_recFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point L541'(line 541) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point strlen_recErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L404 ceAbstractionStarter]: At program point strlen_recENTRY(lines 540 545) the Hoare annotation is: true [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point strlen_recErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 19:59:31,317 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 19:59:31,318 INFO L397 ceAbstractionStarter]: At program point L544(line 544) the Hoare annotation is: (let ((.cse9 (select |#memory_int| strlen_rec_~p.base)) (.cse5 (select |#memory_int| |strlen_rec_#in~p.base|))) (let ((.cse0 (not (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= |strlen_rec_#in~p.offset| (+ v_main_~nondetString1~3.offset_BEFORE_CALL_4 1)) (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (select |#length| |strlen_rec_#in~p.base|)) (<= 1 main_~length1~3) (= 0 (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1)))))))) (.cse2 (= (select .cse5 (+ |strlen_rec_#in~p.offset| (- 1))) 0)) (.cse1 (not (= (select |#valid| |strlen_rec_#in~p.base|) 1))) (.cse7 (not (= (select .cse9 strlen_rec_~p.offset) 0))) (.cse8 (= 1 (select |#valid| strlen_rec_~p.base))) (.cse3 (let ((.cse10 (select |#length| |strlen_rec_#in~p.base|))) (and (< .cse10 3) (not (= 0 (select .cse5 1))) (< 1 .cse10)))) (.cse4 (not (= 0 |strlen_rec_#in~p.offset|))) (.cse6 (not (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= |strlen_rec_#in~p.offset| v_main_~nondetString1~3.offset_BEFORE_CALL_2) (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| |strlen_rec_#in~p.base|)) (= (select (select |#memory_int| |strlen_rec_#in~p.base|) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= 1 main_~length1~3)))))) (and (or .cse0 (<= 2 strlen_rec_~p.offset) (< |strlen_rec_#in~p.offset| 2) .cse1 .cse2) (or .cse1 .cse3 .cse4 (not (= 0 (select .cse5 |strlen_rec_#in~p.offset|))) .cse6) (or .cse0 (and (<= 1 strlen_rec_~p.offset) .cse7 .cse8 (not (= (select .cse9 (+ strlen_rec_~p.offset (- 1))) 0)) (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_4 Int)) (and (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4) (select |#length| strlen_rec_~p.base)) (<= strlen_rec_~p.offset (+ v_main_~nondetString1~3.offset_BEFORE_CALL_4 1)) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_4 (- 1)))) (<= 1 main_~length1~3)))) .cse1 (< |strlen_rec_#in~p.offset| 1) .cse2) (or .cse1 (and .cse7 .cse8 (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2) (select |#length| strlen_rec_~p.base)) (<= strlen_rec_~p.offset v_main_~nondetString1~3.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| strlen_rec_~p.base) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1)))) (<= 1 main_~length1~3))) (= strlen_rec_~p.offset 0)) .cse3 .cse4 .cse6)))) [2018-01-24 19:59:31,318 INFO L401 ceAbstractionStarter]: For program point strlen_recEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-24 19:59:31,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:59:31 BoogieIcfgContainer [2018-01-24 19:59:31,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:59:31,321 INFO L168 Benchmark]: Toolchain (without parser) took 26737.77 ms. Allocated memory was 305.7 MB in the beginning and 853.5 MB in the end (delta: 547.9 MB). Free memory was 263.0 MB in the beginning and 634.9 MB in the end (delta: -372.0 MB). Peak memory consumption was 175.9 MB. Max. memory is 5.3 GB. [2018-01-24 19:59:31,321 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.7 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:59:31,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.08 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 19:59:31,322 INFO L168 Benchmark]: Boogie Preprocessor took 36.09 ms. Allocated memory is still 305.7 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:59:31,322 INFO L168 Benchmark]: RCFGBuilder took 215.17 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 238.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-01-24 19:59:31,323 INFO L168 Benchmark]: TraceAbstraction took 26263.61 ms. Allocated memory was 305.7 MB in the beginning and 853.5 MB in the end (delta: 547.9 MB). Free memory was 238.1 MB in the beginning and 634.9 MB in the end (delta: -396.8 MB). Peak memory consumption was 151.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:59:31,324 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 305.7 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.08 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.09 ms. Allocated memory is still 305.7 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 215.17 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 238.1 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 26263.61 ms. Allocated memory was 305.7 MB in the beginning and 853.5 MB in the end (delta: 547.9 MB). Free memory was 238.1 MB in the beginning and 634.9 MB in the end (delta: -396.8 MB). Peak memory consumption was 151.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 96 LocStat_NO_SUPPORTING_DISEQUALITIES : 14 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 35 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.955673 RENAME_VARIABLES(MILLISECONDS) : 0.010629 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.797177 PROJECTAWAY(MILLISECONDS) : 1.235214 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.203236 DISJOIN(MILLISECONDS) : 0.196570 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.031049 ADD_EQUALITY(MILLISECONDS) : 0.015068 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016278 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 83 #UNFREEZE : 0 #CONJOIN : 80 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 79 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 26.1s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 266 SDslu, 748 SDs, 0 SdLazy, 775 SolverSat, 135 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 91 SyntacticMatches, 10 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 19 PreInvPairs, 20 NumberOfFragments, 406 HoareAnnotationTreeSize, 19 FomulaSimplifications, 118 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 968 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 257 ConstructedInterpolants, 20 QuantifiedInterpolants, 41980 SizeOfPredicates, 47 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 6/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-59-31-332.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-59-31-332.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-59-31-332.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-59-31-332.csv Received shutdown request...