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_Camel+AI_EQ.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 11:48:50,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:48:50,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:48:50,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:48:50,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:48:50,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:48:50,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:48:50,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:48:50,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:48:50,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:48:50,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:48:50,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:48:50,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:48:50,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:48:50,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:48:50,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:48:50,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:48:50,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:48:50,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:48:50,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:48:50,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:48:50,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:48:50,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:48:50,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:48:50,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:48:50,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:48:50,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:48:50,583 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:48:50,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:48:50,583 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:48:50,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:48:50,584 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:48:50,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:48:50,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:48:50,594 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:48:50,594 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:48:50,594 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:48:50,594 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:48:50,594 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:48:50,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:48:50,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:48:50,595 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:48:50,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:48:50,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:48:50,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:48:50,596 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:48:50,596 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:48:50,596 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:48:50,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:48:50,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:48:50,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:48:50,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:48:50,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:48:50,597 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:48:50,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:48:50,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:48:50,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:48:50,598 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:48:50,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:48:50,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:48:50,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:48:50,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:48:50,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:48:50,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:48:50,599 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:48:50,600 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:48:50,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:48:50,643 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:48:50,646 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:48:50,647 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:48:50,648 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:48:50,648 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 11:48:50,815 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:48:50,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:48:50,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:48:50,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:48:50,826 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:48:50,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:48:50" (1/1) ... [2018-01-24 11:48:50,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214b3e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:50, skipping insertion in model container [2018-01-24 11:48:50,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:48:50" (1/1) ... [2018-01-24 11:48:50,842 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:48:50,878 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:48:50,993 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:48:51,010 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:48:51,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51 WrapperNode [2018-01-24 11:48:51,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:48:51,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:48:51,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:48:51,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:48:51,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (1/1) ... [2018-01-24 11:48:51,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (1/1) ... [2018-01-24 11:48:51,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (1/1) ... [2018-01-24 11:48:51,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (1/1) ... [2018-01-24 11:48:51,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (1/1) ... [2018-01-24 11:48:51,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (1/1) ... [2018-01-24 11:48:51,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (1/1) ... [2018-01-24 11:48:51,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:48:51,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:48:51,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:48:51,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:48:51,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (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 11:48:51,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:48:51,102 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:48:51,102 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-01-24 11:48:51,102 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:48:51,102 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:48:51,102 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:48:51,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:48:51,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:48:51,102 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:48:51,102 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:48:51,102 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-01-24 11:48:51,103 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:48:51,103 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:48:51,103 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:48:51,256 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:48:51,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:48:51 BoogieIcfgContainer [2018-01-24 11:48:51,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:48:51,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:48:51,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:48:51,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:48:51,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:48:50" (1/3) ... [2018-01-24 11:48:51,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3665150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:48:51, skipping insertion in model container [2018-01-24 11:48:51,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:48:51" (2/3) ... [2018-01-24 11:48:51,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3665150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:48:51, skipping insertion in model container [2018-01-24 11:48:51,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:48:51" (3/3) ... [2018-01-24 11:48:51,262 INFO L105 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:48:51,269 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:48:51,275 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 11:48:51,323 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:48:51,323 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:48:51,324 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:48:51,324 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:48:51,324 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:48:51,324 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:48:51,324 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:48:51,324 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:48:51,325 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:48:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 11:48:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:48:51,352 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:51,354 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:51,354 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:48:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash -407257815, now seen corresponding path program 1 times [2018-01-24 11:48:51,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:51,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:51,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:51,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:51,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:51,661 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 11:48:51,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:51,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:48:51,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:48:51,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:48:51,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:48:51,678 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-01-24 11:48:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:51,819 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-01-24 11:48:51,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:48:51,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 11:48:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:51,832 INFO L225 Difference]: With dead ends: 30 [2018-01-24 11:48:51,832 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 11:48:51,836 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 11:48:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 11:48:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 11:48:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 11:48:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-01-24 11:48:51,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-01-24 11:48:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:51,869 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-01-24 11:48:51,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:48:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-01-24 11:48:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:48:51,870 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:51,870 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:51,870 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:48:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash -407257816, now seen corresponding path program 1 times [2018-01-24 11:48:51,871 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:51,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:51,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:51,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:51,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:51,912 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 11:48:51,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:51,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:48:51,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:48:51,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:48:51,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:48:51,915 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-01-24 11:48:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:51,972 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-01-24 11:48:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:48:51,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 11:48:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:51,973 INFO L225 Difference]: With dead ends: 26 [2018-01-24 11:48:51,974 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 11:48:51,974 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 11:48:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 11:48:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 11:48:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 11:48:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-24 11:48:51,979 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2018-01-24 11:48:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:51,980 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-24 11:48:51,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:48:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-24 11:48:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:48:51,980 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:51,980 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:51,980 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:48:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash 665022209, now seen corresponding path program 1 times [2018-01-24 11:48:51,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:51,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:51,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:51,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:51,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:52,042 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 11:48:52,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:52,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:48:52,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:48:52,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:48:52,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:48:52,044 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-01-24 11:48:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:52,094 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-01-24 11:48:52,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:48:52,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 11:48:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:52,095 INFO L225 Difference]: With dead ends: 25 [2018-01-24 11:48:52,095 INFO L226 Difference]: Without dead ends: 24 [2018-01-24 11:48:52,096 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 11:48:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-24 11:48:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-24 11:48:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-24 11:48:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-01-24 11:48:52,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-01-24 11:48:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:52,100 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-01-24 11:48:52,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:48:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-01-24 11:48:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 11:48:52,101 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:52,101 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:52,101 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:48:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash 665022210, now seen corresponding path program 1 times [2018-01-24 11:48:52,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:52,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:52,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:52,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:52,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:52,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:52,313 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 11:48:52,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:52,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:48:52,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:48:52,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:48:52,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:48:52,315 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-01-24 11:48:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:52,447 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-01-24 11:48:52,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:48:52,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-01-24 11:48:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:52,448 INFO L225 Difference]: With dead ends: 32 [2018-01-24 11:48:52,449 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 11:48:52,449 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:48:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 11:48:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 11:48:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 11:48:52,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 11:48:52,455 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2018-01-24 11:48:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:52,456 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 11:48:52,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:48:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 11:48:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:48:52,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:52,457 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:52,457 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:48:52,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1167971539, now seen corresponding path program 1 times [2018-01-24 11:48:52,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:52,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:52,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:52,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:52,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:52,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:52,624 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 11:48:52,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:48:52,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 11:48:52,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:48:52,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:48:52,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:48:52,625 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-01-24 11:48:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:52,790 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-24 11:48:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:48:52,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 11:48:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:52,791 INFO L225 Difference]: With dead ends: 62 [2018-01-24 11:48:52,791 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:48:52,792 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:48:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:48:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-01-24 11:48:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 11:48:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 11:48:52,799 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 17 [2018-01-24 11:48:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:52,799 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 11:48:52,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:48:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 11:48:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:48:52,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:52,800 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:52,801 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:48:52,801 INFO L82 PathProgramCache]: Analyzing trace with hash -466906961, now seen corresponding path program 1 times [2018-01-24 11:48:52,801 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:52,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:52,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:52,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:52,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:52,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:52,996 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 11:48:52,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:52,996 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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 11:48:53,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:53,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:53,077 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 11:48:53,079 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 11:48:53,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:53,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:53,086 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 11:48:53,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:48:53,178 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 11:48:53,189 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 11:48:53,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:53,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:53,210 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 11:48:53,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 11:48:53,306 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 11:48:53,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:48:53,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-01-24 11:48:53,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:48:53,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:48:53,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:48:53,342 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 17 states. [2018-01-24 11:48:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:48:53,801 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 11:48:53,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:48:53,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-01-24 11:48:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:48:53,805 INFO L225 Difference]: With dead ends: 50 [2018-01-24 11:48:53,805 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 11:48:53,805 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2018-01-24 11:48:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 11:48:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-01-24 11:48:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:48:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 11:48:53,812 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-01-24 11:48:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:48:53,813 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 11:48:53,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:48:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 11:48:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 11:48:53,814 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:48:53,814 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:48:53,814 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:48:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash -847794598, now seen corresponding path program 2 times [2018-01-24 11:48:53,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:48:53,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:48:53,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:53,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:48:53,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:48:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:48:53,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:48:54,104 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 11:48:54,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:48:54,104 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:48:54,110 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:48:54,120 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:48:54,124 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:48:54,125 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:48:54,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:48:54,142 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 11:48:54,144 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 11:48:54,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:48:54,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:48:54,150 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 11:48:54,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:48:54,603 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 11:48:54,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:48:54,615 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 11:48:54,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:48:54,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:48:54,646 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 11:48:54,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:43 [2018-01-24 11:48:54,694 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 11:48:54,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:48:54,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-01-24 11:48:54,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:48:54,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:48:54,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:48:54,715 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 22 states. [2018-01-24 11:48:55,251 WARN L146 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 33 DAG size of output 33 [2018-01-24 11:49:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:00,937 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 11:49:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:49:00,938 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-01-24 11:49:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:00,939 INFO L225 Difference]: With dead ends: 56 [2018-01-24 11:49:00,939 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 11:49:00,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 11:49:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 11:49:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-01-24 11:49:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:49:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 11:49:00,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 21 [2018-01-24 11:49:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:00,951 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 11:49:00,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:49:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 11:49:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:49:00,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:00,952 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 11:49:00,952 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-01-24 11:49:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1711563014, now seen corresponding path program 1 times [2018-01-24 11:49:00,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:00,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:00,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:00,954 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:49:00,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:00,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:01,050 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 11:49:01,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:01,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:49:01,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:49:01,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:49:01,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:49:01,051 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-01-24 11:49:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:01,112 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 11:49:01,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:49:01,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 11:49:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:01,113 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:49:01,113 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:49:01,113 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 11:49:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:49:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:49:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:49:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:49:01,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-24 11:49:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:01,114 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:49:01,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:49:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:49:01,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:49:01,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:49:01,589 WARN L146 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 126 DAG size of output 88 [2018-01-24 11:49:01,653 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,653 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:01,653 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,654 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 554) the Hoare annotation is: true [2018-01-24 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,654 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 554) the Hoare annotation is: true [2018-01-24 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-24 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-24 11:49:01,654 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 11:49:01,654 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 546 554) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 554) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 546 554) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 546 554) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point strlen_recFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point L541'(line 541) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point strlen_recErr1RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,655 INFO L404 ceAbstractionStarter]: At program point strlen_recENTRY(lines 540 545) the Hoare annotation is: true [2018-01-24 11:49:01,655 INFO L401 ceAbstractionStarter]: For program point strlen_recErr0RequiresViolation(lines 1 554) no Hoare annotation was computed. [2018-01-24 11:49:01,656 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 11:49:01,656 INFO L397 ceAbstractionStarter]: At program point L544(line 544) the Hoare annotation is: (let ((.cse11 (select |#memory_int| strlen_rec_~p.base)) (.cse3 (select |#memory_int| |strlen_rec_#in~p.base|)) (.cse10 (select |#length| |strlen_rec_#in~p.base|))) (let ((.cse1 (and (< .cse10 3) (not (= 0 (select .cse3 1))) (< 1 .cse10))) (.cse2 (not (= 0 |strlen_rec_#in~p.offset|))) (.cse4 (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))))) (.cse5 (not (= (select .cse11 strlen_rec_~p.offset) 0))) (.cse6 (= 1 (select |#valid| strlen_rec_~p.base))) (.cse7 (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)))) (.cse0 (not (= (select |#valid| |strlen_rec_#in~p.base|) 1))) (.cse8 (not (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_#in~p.base|)) (<= |strlen_rec_#in~p.offset| (+ v_main_~nondetString1~3.offset_BEFORE_CALL_2 1)) (= (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))))) (.cse9 (= (select .cse3 (+ |strlen_rec_#in~p.offset| (- 1))) 0))) (and (or .cse0 .cse1 .cse2 (not (= 0 (select .cse3 |strlen_rec_#in~p.offset|))) .cse4) (or .cse0 (and .cse5 .cse6 .cse7 (= strlen_rec_~p.offset 0)) .cse1 .cse2 .cse4) (or (< |strlen_rec_#in~p.offset| 2) .cse0 .cse8 (and .cse7 (<= 2 strlen_rec_~p.offset) .cse5 .cse6) .cse9) (or (and (< .cse10 (+ |strlen_rec_#in~p.offset| 2)) (< 1 |strlen_rec_#in~p.offset|)) (and (<= 1 strlen_rec_~p.offset) .cse5 .cse6 (not (= (select .cse11 (+ strlen_rec_~p.offset (- 1))) 0)) .cse7) .cse0 (< |strlen_rec_#in~p.offset| 1) .cse8 .cse9)))) [2018-01-24 11:49:01,656 INFO L401 ceAbstractionStarter]: For program point strlen_recEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-24 11:49:01,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:49:01 BoogieIcfgContainer [2018-01-24 11:49:01,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:49:01,659 INFO L168 Benchmark]: Toolchain (without parser) took 10843.68 ms. Allocated memory was 304.1 MB in the beginning and 510.1 MB in the end (delta: 206.0 MB). Free memory was 260.9 MB in the beginning and 316.5 MB in the end (delta: -55.6 MB). Peak memory consumption was 150.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:01,660 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:49:01,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.43 ms. Allocated memory is still 304.1 MB. Free memory was 260.9 MB in the beginning and 250.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:01,661 INFO L168 Benchmark]: Boogie Preprocessor took 35.08 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:01,661 INFO L168 Benchmark]: RCFGBuilder took 202.67 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 235.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:01,661 INFO L168 Benchmark]: TraceAbstraction took 10401.26 ms. Allocated memory was 304.1 MB in the beginning and 510.1 MB in the end (delta: 206.0 MB). Free memory was 233.9 MB in the beginning and 316.5 MB in the end (delta: -82.5 MB). Peak memory consumption was 123.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:01,663 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.12 ms. Allocated memory is still 304.1 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.43 ms. Allocated memory is still 304.1 MB. Free memory was 260.9 MB in the beginning and 250.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.08 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 202.67 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 235.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10401.26 ms. Allocated memory was 304.1 MB in the beginning and 510.1 MB in the end (delta: 206.0 MB). Free memory was 233.9 MB in the beginning and 316.5 MB in the end (delta: -82.5 MB). Peak memory consumption was 123.5 MB. Max. memory is 5.3 GB. * 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, 10.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 174 SDtfs, 260 SDslu, 688 SDs, 0 SdLazy, 735 SolverSat, 143 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 3.1s 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, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 19 PreInvPairs, 20 NumberOfFragments, 456 HoareAnnotationTreeSize, 19 FomulaSimplifications, 118 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 916 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 149 ConstructedInterpolants, 10 QuantifiedInterpolants, 19012 SizeOfPredicates, 14 NumberOfNonLiveVariables, 169 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 4/22 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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-49-01-670.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_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-49-01-670.csv Received shutdown request...