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/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:40:59,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:40:59,339 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:40:59,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:40:59,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:40:59,356 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:40:59,357 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:40:59,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:40:59,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:40:59,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:40:59,363 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:40:59,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:40:59,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:40:59,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:40:59,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:40:59,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:40:59,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:40:59,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:40:59,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:40:59,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:40:59,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:40:59,379 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:40:59,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:40:59,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:40:59,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:40:59,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:40:59,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:40:59,384 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:40:59,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:40:59,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:40:59,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:40:59,385 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:40:59,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:40:59,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:40:59,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:40:59,395 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:40:59,395 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:40:59,395 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:40:59,395 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:40:59,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:40:59,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:40:59,396 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:40:59,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:40:59,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:40:59,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:40:59,397 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:40:59,397 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:40:59,397 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:40:59,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:40:59,397 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:40:59,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:40:59,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:40:59,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:40:59,398 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:40:59,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:40:59,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:40:59,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:40:59,399 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:40:59,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:40:59,399 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:40:59,399 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:40:59,399 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:40:59,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:40:59,399 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:40:59,400 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:40:59,400 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:40:59,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:40:59,445 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:40:59,449 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:40:59,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:40:59,451 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:40:59,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:40:59,631 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:40:59,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:40:59,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:40:59,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:40:59,642 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:40:59,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5054e5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59, skipping insertion in model container [2018-01-24 11:40:59,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,659 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:40:59,697 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:40:59,815 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:40:59,832 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:40:59,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59 WrapperNode [2018-01-24 11:40:59,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:40:59,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:40:59,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:40:59,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:40:59,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (1/1) ... [2018-01-24 11:40:59,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:40:59,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:40:59,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:40:59,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:40:59,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (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:40:59,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:40:59,928 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:40:59,929 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 11:40:59,929 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:40:59,929 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:40:59,929 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:40:59,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:40:59,929 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:40:59,930 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:40:59,930 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:40:59,930 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 11:40:59,930 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:40:59,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:40:59,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:41:00,078 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:41:00,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:41:00 BoogieIcfgContainer [2018-01-24 11:41:00,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:41:00,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:41:00,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:41:00,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:41:00,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:40:59" (1/3) ... [2018-01-24 11:41:00,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e9999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:41:00, skipping insertion in model container [2018-01-24 11:41:00,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:40:59" (2/3) ... [2018-01-24 11:41:00,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263e9999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:41:00, skipping insertion in model container [2018-01-24 11:41:00,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:41:00" (3/3) ... [2018-01-24 11:41:00,086 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:41:00,093 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:41:00,101 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 11:41:00,144 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:41:00,144 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:41:00,145 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:41:00,145 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:41:00,145 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:41:00,145 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:41:00,145 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:41:00,145 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:41:00,146 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:41:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 11:41:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:41:00,174 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:00,175 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:00,175 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:00,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-01-24 11:41:00,181 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:00,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:00,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:00,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:00,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:00,371 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:41:00,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:00,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:41:00,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:41:00,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:41:00,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:41:00,388 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-01-24 11:41:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:00,563 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-24 11:41:00,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:41:00,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 11:41:00,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:00,573 INFO L225 Difference]: With dead ends: 41 [2018-01-24 11:41:00,573 INFO L226 Difference]: Without dead ends: 26 [2018-01-24 11:41:00,576 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:41:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-24 11:41:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-24 11:41:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 11:41:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 11:41:00,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-01-24 11:41:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:00,607 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 11:41:00,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:41:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 11:41:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 11:41:00,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:00,608 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:00,608 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:00,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-01-24 11:41:00,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:00,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:00,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:00,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:00,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:00,743 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:41:00,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:00,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:41:00,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:41:00,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:41:00,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:41:00,747 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-24 11:41:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:00,866 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-24 11:41:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:41:00,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 11:41:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:00,868 INFO L225 Difference]: With dead ends: 26 [2018-01-24 11:41:00,868 INFO L226 Difference]: Without dead ends: 25 [2018-01-24 11:41:00,869 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:41:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-24 11:41:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-01-24 11:41:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 11:41:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 11:41:00,874 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-01-24 11:41:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:00,875 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 11:41:00,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:41:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 11:41:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:41:00,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:00,876 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:00,876 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-01-24 11:41:00,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:00,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:00,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:00,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:00,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:00,943 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:41:00,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:00,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:41:00,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:41:00,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:41:00,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:41:00,945 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-01-24 11:41:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:00,976 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-01-24 11:41:00,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:41:00,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 11:41:00,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:00,977 INFO L225 Difference]: With dead ends: 25 [2018-01-24 11:41:00,977 INFO L226 Difference]: Without dead ends: 24 [2018-01-24 11:41:00,978 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:41:00,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-24 11:41:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-24 11:41:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-24 11:41:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-24 11:41:00,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-01-24 11:41:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:00,983 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-24 11:41:00,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:41:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-24 11:41:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 11:41:00,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:00,984 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:00,984 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-01-24 11:41:00,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:00,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:00,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:00,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:01,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:01,112 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:41:01,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:01,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:41:01,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:41:01,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:41:01,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:41:01,113 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-01-24 11:41:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:01,207 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-01-24 11:41:01,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:41:01,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-01-24 11:41:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:01,210 INFO L225 Difference]: With dead ends: 31 [2018-01-24 11:41:01,210 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 11:41:01,211 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 11:41:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 11:41:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-01-24 11:41:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-24 11:41:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-24 11:41:01,214 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-01-24 11:41:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:01,215 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-24 11:41:01,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:41:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-24 11:41:01,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:41:01,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:01,215 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:41:01,216 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-01-24 11:41:01,216 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:01,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:01,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:01,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:01,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:01,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:01,343 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:41:01,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:01,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 11:41:01,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:41:01,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:41:01,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:41:01,345 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-01-24 11:41:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:01,523 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-24 11:41:01,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:41:01,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-01-24 11:41:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:01,524 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:41:01,524 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 11:41:01,525 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:41:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 11:41:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-01-24 11:41:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 11:41:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-01-24 11:41:01,533 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-01-24 11:41:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:01,533 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-01-24 11:41:01,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:41:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-01-24 11:41:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:41:01,534 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:01,534 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:41:01,535 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-01-24 11:41:01,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:01,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:01,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:01,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:01,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:01,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:01,731 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:41:01,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:01,732 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:41:01,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:01,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:01,807 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:41:01,814 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:41:01,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:01,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:01,821 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:41:01,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:41:01,914 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:41:01,930 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:41:01,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:01,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:01,991 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:41:01,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 11:41:02,055 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:41:02,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:02,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-01-24 11:41:02,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:41:02,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:41:02,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:41:02,079 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-01-24 11:41:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:02,538 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 11:41:02,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:41:02,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-01-24 11:41:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:02,539 INFO L225 Difference]: With dead ends: 48 [2018-01-24 11:41:02,540 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:41:02,540 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:41:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:41:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-01-24 11:41:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 11:41:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-24 11:41:02,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-01-24 11:41:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:02,547 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-24 11:41:02,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:41:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-24 11:41:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:41:02,548 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:02,548 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:02,549 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-01-24 11:41:02,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:02,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:02,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:02,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:02,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:02,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:02,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:02,780 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:41:02,785 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:41:02,794 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:02,798 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:02,800 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:41:02,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:02,805 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 11:41:02,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:02,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:02,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:41:02,837 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 11:41:02,838 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 11:41:02,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:02,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:02,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:02,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 11:41:02,946 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 11:41:02,953 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 13 [2018-01-24 11:41:02,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:02,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:02,967 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 11:41:02,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 11:41:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:03,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:03,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-24 11:41:03,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:41:03,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:41:03,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:41:03,039 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-01-24 11:41:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:03,505 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 11:41:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:41:03,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-01-24 11:41:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:03,506 INFO L225 Difference]: With dead ends: 47 [2018-01-24 11:41:03,506 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 11:41:03,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:41:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 11:41:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-01-24 11:41:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 11:41:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-24 11:41:03,515 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 20 [2018-01-24 11:41:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:03,515 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-24 11:41:03,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:41:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-24 11:41:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:41:03,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:03,516 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, 1, 1] [2018-01-24 11:41:03,516 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:41:03,516 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-01-24 11:41:03,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:03,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:03,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:03,517 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:41:03,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:03,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:03,572 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:41:03,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:03,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:41:03,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:41:03,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:41:03,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:41:03,573 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-01-24 11:41:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:03,689 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-24 11:41:03,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:41:03,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 11:41:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:03,690 INFO L225 Difference]: With dead ends: 34 [2018-01-24 11:41:03,690 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:41:03,691 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:41:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:41:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:41:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:41:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:41:03,691 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-24 11:41:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:03,691 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:41:03,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:41:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:41:03,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:41:03,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:41:03,913 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 54 DAG size of output 1 [2018-01-24 11:41:04,812 WARN L146 SmtUtils]: Spent 897ms on a formula simplification. DAG size of input: 94 DAG size of output 59 [2018-01-24 11:41:04,866 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,867 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:41:04,867 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,867 INFO L404 ceAbstractionStarter]: At program point cstrlenENTRY(lines 540 546) the Hoare annotation is: true [2018-01-24 11:41:04,867 INFO L397 ceAbstractionStarter]: At program point L543'''(lines 543 544) the Hoare annotation is: (let ((.cse1 (< (select |#length| |cstrlen_#in~s.base|) 1)) (.cse2 (not (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstrlen_#in~s.base|) (+ (select |#length| |cstrlen_#in~s.base|) v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 |cstrlen_#in~s.offset|) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_2))))) (.cse3 (not (= (select |#valid| |cstrlen_#in~s.base|) 1))) (.cse0 (= cstrlen_~p~2.offset 0)) (.cse4 (not (= 0 |cstrlen_#in~s.offset|)))) (and (or (and (= 0 (select (select |#memory_int| cstrlen_~p~2.base) cstrlen_~p~2.offset)) .cse0) (not (= 0 (select (select |#memory_int| |cstrlen_#in~s.base|) |cstrlen_#in~s.offset|))) .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse2 .cse3 (let ((.cse5 (select |#length| cstrlen_~p~2.base)) (.cse6 (= 1 (select |#valid| cstrlen_~p~2.base)))) (or (and (<= (+ cstrlen_~p~2.offset 1) .cse5) (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 0) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= (+ v_main_~nondetString1~3.offset_BEFORE_CALL_2 1) cstrlen_~p~2.offset) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_2))) .cse6) (and (<= 1 .cse5) .cse6 .cse0 (exists ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 0) (= (select (select |#memory_int| cstrlen_~p~2.base) (+ (select |#length| cstrlen_~p~2.base) v_main_~nondetString1~3.offset_BEFORE_CALL_2 (- 1))) 0) (<= v_main_~nondetString1~3.offset_BEFORE_CALL_2 cstrlen_~p~2.offset) (<= 0 v_main_~nondetString1~3.offset_BEFORE_CALL_2)))))) .cse4))) [2018-01-24 11:41:04,867 INFO L401 ceAbstractionStarter]: For program point cstrlenErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,867 INFO L401 ceAbstractionStarter]: For program point cstrlenEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 544) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point cstrlenErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point cstrlenFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,868 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L397 ceAbstractionStarter]: At program point L553'(line 553) 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)) (= (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~nondetString1~3.offset .cse0 (- 1))) 0) (= 1 (select |#valid| main_~nondetString1~3.base)) (= 0 |main_#t~malloc3.offset|) (= 0 main_~nondetString1~3.offset) (<= 1 main_~length1~3) (= main_~length1~3 (select |#length| |main_#t~malloc3.base|)))) [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 555) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 555) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 555) no Hoare annotation was computed. [2018-01-24 11:41:04,869 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:41:04,870 INFO L401 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-24 11:41:04,870 INFO L401 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-24 11:41:04,875 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,876 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,877 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,881 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,882 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,883 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,884 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,890 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,890 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,890 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,891 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,891 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,891 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,892 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,892 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,892 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,893 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,900 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,901 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,902 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,902 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,905 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:41:04 BoogieIcfgContainer [2018-01-24 11:41:04,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:41:04,910 INFO L168 Benchmark]: Toolchain (without parser) took 5278.44 ms. Allocated memory was 308.8 MB in the beginning and 521.1 MB in the end (delta: 212.3 MB). Free memory was 268.8 MB in the beginning and 493.9 MB in the end (delta: -225.1 MB). Peak memory consumption was 158.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:41:04,911 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:41:04,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.71 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 258.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:41:04,912 INFO L168 Benchmark]: Boogie Preprocessor took 36.00 ms. Allocated memory is still 308.8 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 11:41:04,912 INFO L168 Benchmark]: RCFGBuilder took 202.14 ms. Allocated memory is still 308.8 MB. Free memory was 256.6 MB in the beginning and 242.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:41:04,913 INFO L168 Benchmark]: TraceAbstraction took 4829.26 ms. Allocated memory was 308.8 MB in the beginning and 521.1 MB in the end (delta: 212.3 MB). Free memory was 241.8 MB in the beginning and 493.9 MB in the end (delta: -252.2 MB). Peak memory consumption was 131.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:41:04,915 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.14 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.71 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 258.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.00 ms. Allocated memory is still 308.8 MB. Free memory was 257.6 MB in the beginning and 256.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 202.14 ms. Allocated memory is still 308.8 MB. Free memory was 256.6 MB in the beginning and 242.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4829.26 ms. Allocated memory was 308.8 MB in the beginning and 521.1 MB in the end (delta: 212.3 MB). Free memory was 241.8 MB in the beginning and 493.9 MB in the end (delta: -252.2 MB). Peak memory consumption was 131.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 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: 547]: 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 11:41:04,922 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,923 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,924 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,925 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,926 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,926 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,926 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,926 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,926 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,927 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,928 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,929 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,932 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,933 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,934 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:41:04,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,935 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,936 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,937 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:41:04,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:41:04,938 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((0 == unknown-#memory_int-unknown[p][p] && p == 0) || !(0 == unknown-#memory_int-unknown[s][s])) || unknown-#length-unknown[s] < 1) || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0 && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= s) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2)) || !(\valid[s] == 1)) || !(0 == s)) && ((((unknown-#length-unknown[s] < 1 || !(\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0 && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= s) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2)) || !(\valid[s] == 1)) || ((p + 1 <= unknown-#length-unknown[p] && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0 && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 + 1 <= p) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2)) && 1 == \valid[p]) || (((1 <= unknown-#length-unknown[p] && 1 == \valid[p]) && p == 0) && (\exists v_main_~nondetString1~3.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= 0 && unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~3.offset_BEFORE_CALL_2 + -1] == 0) && v_main_~nondetString1~3.offset_BEFORE_CALL_2 <= p) && 0 <= v_main_~nondetString1~3.offset_BEFORE_CALL_2))) || !(0 == s)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 4.7s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 243 SDslu, 522 SDs, 0 SdLazy, 514 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 235 HoareAnnotationTreeSize, 9 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 757 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 151 ConstructedInterpolants, 10 QuantifiedInterpolants, 17862 SizeOfPredicates, 14 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 4/20 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/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-41-04-944.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-41-04-944.csv Received shutdown request...