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_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:20:26,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:20:26,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:20:26,711 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:20:26,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:20:26,712 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:20:26,714 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:20:26,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:20:26,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:20:26,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:20:26,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:20:26,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:20:26,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:20:26,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:20:26,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:20:26,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:20:26,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:20:26,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:20:26,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:20:26,734 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:20:26,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:20:26,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:20:26,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:20:26,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:20:26,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:20:26,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:20:26,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:20:26,741 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:20:26,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:20:26,742 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:20:26,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:20:26,743 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_SS.epf [2018-01-31 08:20:26,753 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:20:26,753 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:20:26,754 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:20:26,754 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:20:26,755 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:20:26,755 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:20:26,755 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:20:26,756 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:20:26,756 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:20:26,756 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:20:26,756 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:20:26,756 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:20:26,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:20:26,757 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:20:26,757 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:20:26,757 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:20:26,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:20:26,758 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:20:26,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:20:26,758 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:20:26,758 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:20:26,758 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:20:26,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:20:26,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:20:26,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:20:26,759 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:20:26,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:20:26,759 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:20:26,760 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:20:26,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:20:26,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:20:26,760 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:20:26,761 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:20:26,761 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:20:26,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:20:26,815 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:20:26,820 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:20:26,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:20:26,822 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:20:26,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:20:27,009 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:20:27,017 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:20:27,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:20:27,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:20:27,025 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:20:27,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d782bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27, skipping insertion in model container [2018-01-31 08:20:27,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,049 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:20:27,107 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:20:27,284 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:20:27,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:20:27,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27 WrapperNode [2018-01-31 08:20:27,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:20:27,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:20:27,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:20:27,322 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:20:27,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (1/1) ... [2018-01-31 08:20:27,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:20:27,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:20:27,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:20:27,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:20:27,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (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-31 08:20:27,441 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:20:27,441 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:20:27,442 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-31 08:20:27,442 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:20:27,442 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:20:27,444 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:20:27,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:20:27,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:20:27,445 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:20:27,445 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:20:27,445 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-31 08:20:27,445 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:20:27,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:20:27,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:20:27,903 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:20:27,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:20:27 BoogieIcfgContainer [2018-01-31 08:20:27,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:20:27,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:20:27,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:20:27,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:20:27,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:20:27" (1/3) ... [2018-01-31 08:20:27,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cdeab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:20:27, skipping insertion in model container [2018-01-31 08:20:27,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:27" (2/3) ... [2018-01-31 08:20:27,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cdeab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:20:27, skipping insertion in model container [2018-01-31 08:20:27,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:20:27" (3/3) ... [2018-01-31 08:20:27,912 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:20:27,922 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:20:27,930 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 08:20:27,986 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:20:27,986 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:20:27,986 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:20:27,986 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:20:27,987 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:20:27,987 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:20:27,987 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:20:27,987 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:20:27,988 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:20:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 08:20:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:20:28,018 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:28,019 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:28,019 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:28,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1900740219, now seen corresponding path program 1 times [2018-01-31 08:20:28,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:28,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:28,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:28,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:28,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:28,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:28,327 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-31 08:20:28,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:28,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:20:28,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:20:28,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:20:28,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:20:28,344 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-01-31 08:20:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:28,662 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-31 08:20:28,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:20:28,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-31 08:20:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:28,673 INFO L225 Difference]: With dead ends: 82 [2018-01-31 08:20:28,673 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 08:20:28,676 INFO L554 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-31 08:20:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 08:20:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-31 08:20:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 08:20:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-31 08:20:28,709 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 13 [2018-01-31 08:20:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:28,710 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-31 08:20:28,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:20:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-31 08:20:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:20:28,710 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:28,711 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:28,711 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1900740220, now seen corresponding path program 1 times [2018-01-31 08:20:28,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:28,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:28,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:28,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:28,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:28,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:29,004 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-31 08:20:29,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:29,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:20:29,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:20:29,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:20:29,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:20:29,007 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2018-01-31 08:20:29,201 WARN L143 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:20:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:29,259 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-31 08:20:29,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:20:29,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-31 08:20:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:29,260 INFO L225 Difference]: With dead ends: 57 [2018-01-31 08:20:29,260 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 08:20:29,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:20:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 08:20:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-31 08:20:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 08:20:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-31 08:20:29,270 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 13 [2018-01-31 08:20:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:29,270 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-31 08:20:29,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:20:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-31 08:20:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:20:29,272 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:29,272 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:29,272 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash -111322581, now seen corresponding path program 1 times [2018-01-31 08:20:29,272 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:29,272 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:29,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:29,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:29,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:29,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:29,379 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-31 08:20:29,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:29,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:20:29,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:20:29,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:20:29,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:20:29,380 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-01-31 08:20:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:29,586 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-01-31 08:20:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:20:29,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-31 08:20:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:29,588 INFO L225 Difference]: With dead ends: 60 [2018-01-31 08:20:29,588 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 08:20:29,589 INFO L554 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-31 08:20:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 08:20:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-31 08:20:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 08:20:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-31 08:20:29,596 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 19 [2018-01-31 08:20:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:29,596 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-31 08:20:29,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:20:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-31 08:20:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:20:29,597 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:29,598 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:29,598 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash -111322580, now seen corresponding path program 1 times [2018-01-31 08:20:29,598 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:29,598 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:29,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:29,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:29,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:29,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:29,768 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-31 08:20:29,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:29,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:20:29,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:20:29,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:20:29,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:20:29,769 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 8 states. [2018-01-31 08:20:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:30,296 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-31 08:20:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:20:30,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-31 08:20:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:30,300 INFO L225 Difference]: With dead ends: 81 [2018-01-31 08:20:30,300 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:20:30,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:20:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:20:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2018-01-31 08:20:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 08:20:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-31 08:20:30,310 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 19 [2018-01-31 08:20:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:30,310 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-31 08:20:30,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:20:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-31 08:20:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 08:20:30,312 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:30,312 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:30,312 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1981825201, now seen corresponding path program 1 times [2018-01-31 08:20:30,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:30,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:30,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:30,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:30,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:30,367 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-31 08:20:30,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:30,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:20:30,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:20:30,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:20:30,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:20:30,368 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-01-31 08:20:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:30,387 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-01-31 08:20:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:20:30,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-31 08:20:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:30,390 INFO L225 Difference]: With dead ends: 103 [2018-01-31 08:20:30,390 INFO L226 Difference]: Without dead ends: 67 [2018-01-31 08:20:30,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:20:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-31 08:20:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-31 08:20:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 08:20:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-31 08:20:30,399 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 30 [2018-01-31 08:20:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:30,399 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-31 08:20:30,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:20:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-31 08:20:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 08:20:30,401 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:30,401 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:30,401 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1698677106, now seen corresponding path program 1 times [2018-01-31 08:20:30,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:30,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:30,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:30,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:30,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:30,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:30,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:20:30,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:20:30,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:20:30,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:20:30,555 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 6 states. [2018-01-31 08:20:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:30,682 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-31 08:20:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:20:30,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-31 08:20:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:30,684 INFO L225 Difference]: With dead ends: 67 [2018-01-31 08:20:30,684 INFO L226 Difference]: Without dead ends: 66 [2018-01-31 08:20:30,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:20:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-31 08:20:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-31 08:20:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 08:20:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-31 08:20:30,695 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 32 [2018-01-31 08:20:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:30,695 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-31 08:20:30,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:20:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-31 08:20:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 08:20:30,696 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:30,696 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:30,696 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1698677107, now seen corresponding path program 1 times [2018-01-31 08:20:30,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:30,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:30,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:30,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:30,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:31,063 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-31 08:20:31,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:31,063 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-31 08:20:31,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:31,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:31,159 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-31 08:20:31,161 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-31 08:20:31,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:31,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:31,171 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-31 08:20:31,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:20:31,453 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-31 08:20:31,546 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-31 08:20:31,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:31,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:31,570 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-31 08:20:31,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 08:20:31,804 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-31 08:20:31,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:31,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-31 08:20:31,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:20:31,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:20:31,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:20:31,835 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 20 states. [2018-01-31 08:20:32,661 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 59 DAG size of output 44 [2018-01-31 08:20:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:33,724 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2018-01-31 08:20:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:20:33,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-01-31 08:20:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:33,813 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:20:33,814 INFO L226 Difference]: Without dead ends: 117 [2018-01-31 08:20:33,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:20:33,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-31 08:20:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 79. [2018-01-31 08:20:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 08:20:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-01-31 08:20:33,823 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 32 [2018-01-31 08:20:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:33,824 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-01-31 08:20:33,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:20:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-01-31 08:20:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:20:33,825 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:33,825 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:33,825 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1460258200, now seen corresponding path program 1 times [2018-01-31 08:20:33,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:33,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:33,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:33,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:33,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:33,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:34,009 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-31 08:20:34,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:34,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:20:34,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:20:34,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:20:34,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:20:34,010 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 4 states. [2018-01-31 08:20:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:34,102 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-01-31 08:20:34,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:20:34,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-31 08:20:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:34,103 INFO L225 Difference]: With dead ends: 79 [2018-01-31 08:20:34,103 INFO L226 Difference]: Without dead ends: 59 [2018-01-31 08:20:34,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:20:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-31 08:20:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-31 08:20:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-31 08:20:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-31 08:20:34,111 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2018-01-31 08:20:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:34,111 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-31 08:20:34,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:20:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-31 08:20:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 08:20:34,113 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:34,113 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:34,113 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-31 08:20:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1187011188, now seen corresponding path program 2 times [2018-01-31 08:20:34,113 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:34,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:34,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:34,114 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:34,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:34,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:20:34,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:34,800 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-31 08:20:34,817 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:20:34,835 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:34,859 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:34,872 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:34,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:34,897 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-31 08:20:34,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:34,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:34,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:20:35,034 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-31 08:20:35,047 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-31 08:20:35,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:35,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:35,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:35,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-31 08:20:35,285 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-31 08:20:35,316 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-31 08:20:35,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:35,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:35,334 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-31 08:20:35,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-31 08:20:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:20:35,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:35,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-01-31 08:20:35,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:20:35,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:20:35,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:20:35,502 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 23 states. [2018-01-31 08:20:36,513 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 60 DAG size of output 47 [2018-01-31 08:20:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:37,221 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-01-31 08:20:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:20:37,221 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-01-31 08:20:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:37,222 INFO L225 Difference]: With dead ends: 68 [2018-01-31 08:20:37,222 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:20:37,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=268, Invalid=1372, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:20:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:20:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:20:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:20:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:20:37,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-01-31 08:20:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:37,224 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:20:37,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:20:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:20:37,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:20:37,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:20:38,072 WARN L146 SmtUtils]: Spent 790ms on a formula simplification. DAG size of input: 82 DAG size of output 57 [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point cstrchrErr3RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point cstrchrEXIT(lines 540 545) no Hoare annotation was computed. [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point L542(lines 542 543) no Hoare annotation was computed. [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point L542'''''''''''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 545) no Hoare annotation was computed. [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 08:20:38,116 INFO L399 ceAbstractionStarter]: For program point cstrchrErr2RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point L542'''''''''''''''(lines 542 543) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point L542''''''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point cstrchrErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point cstrchrErr4RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point L542'''''''''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-31 08:20:38,117 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-31 08:20:38,118 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-31 08:20:38,118 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-31 08:20:38,118 INFO L399 ceAbstractionStarter]: For program point L542'''''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,118 INFO L395 ceAbstractionStarter]: At program point L542''''''''''''''(lines 542 543) the Hoare annotation is: (or (and (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 cstrchr_~s.offset) (<= 0 v_main_~nondetString~3.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| cstrchr_~s.base) (+ v_main_~nondetString~3.offset_BEFORE_CALL_2 (select |#length| cstrchr_~s.base) (- 1)))) (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 0))) (exists ((main_~length~3 Int) (v_main_~nondetString~3.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1) (select |#length| cstrchr_~s.base)) (<= 1 main_~length~3) (<= cstrchr_~s.offset v_main_~nondetString~3.offset_BEFORE_CALL_1) (= (select (select |#memory_int| cstrchr_~s.base) (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1 (- 1))) 0))) (= 1 (select |#valid| cstrchr_~s.base))) (not (= 1 (select |#valid| |cstrchr_#in~s.base|))) (not (exists ((v_main_~nondetString~3.offset_BEFORE_CALL_2 Int)) (and (<= 0 v_main_~nondetString~3.offset_BEFORE_CALL_2) (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 |cstrchr_#in~s.offset|) (= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) (+ v_main_~nondetString~3.offset_BEFORE_CALL_2 (select |#length| |cstrchr_#in~s.base|) (- 1)))) (<= v_main_~nondetString~3.offset_BEFORE_CALL_2 0)))) (not (exists ((main_~length~3 Int) (v_main_~nondetString~3.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~3) (= (select (select |#memory_int| |cstrchr_#in~s.base|) (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1 (- 1))) 0) (<= (+ main_~length~3 v_main_~nondetString~3.offset_BEFORE_CALL_1) (select |#length| |cstrchr_#in~s.base|)) (<= |cstrchr_#in~s.offset| v_main_~nondetString~3.offset_BEFORE_CALL_1)))) (not (= 0 |cstrchr_#in~s.offset|))) [2018-01-31 08:20:38,118 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-31 08:20:38,118 INFO L399 ceAbstractionStarter]: For program point cstrchrErr5RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point cstrchrFINAL(lines 540 545) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point L542'''''''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point L542''''''''''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L402 ceAbstractionStarter]: At program point cstrchrENTRY(lines 540 545) the Hoare annotation is: true [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-31 08:20:38,119 INFO L399 ceAbstractionStarter]: For program point cstrchrErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,120 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,120 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,120 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:20:38,120 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,120 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 555) the Hoare annotation is: true [2018-01-31 08:20:38,120 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,120 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 555) the Hoare annotation is: true [2018-01-31 08:20:38,120 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,120 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L395 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ .cse0 main_~nondetString~3.offset (- 1)))) (= 0 |main_#t~malloc7.offset|) (exists ((main_~length~3 Int)) (and (<= 1 main_~length~3) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ main_~nondetString~3.offset main_~length~3 (- 1)))) (<= (+ main_~nondetString~3.offset main_~length~3) (select |#length| main_~nondetString~3.base)))) (= main_~length~3 (select |#length| |main_#t~malloc7.base|)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|) (= main_~nondetString~3.offset 0) (= main_~length~3 .cse0))) [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 546 555) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 546 555) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 555) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 546 555) no Hoare annotation was computed. [2018-01-31 08:20:38,121 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 546 555) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:20:38,122 INFO L399 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-31 08:20:38,122 INFO L399 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-31 08:20:38,122 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-31 08:20:38,122 INFO L399 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-31 08:20:38,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,131 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,132 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,134 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,134 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,134 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,159 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:20:38 BoogieIcfgContainer [2018-01-31 08:20:38,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:20:38,166 INFO L168 Benchmark]: Toolchain (without parser) took 11156.14 ms. Allocated memory was 305.7 MB in the beginning and 535.3 MB in the end (delta: 229.6 MB). Free memory was 265.7 MB in the beginning and 370.2 MB in the end (delta: -104.5 MB). Peak memory consumption was 125.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:38,167 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:20:38,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.07 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:38,167 INFO L168 Benchmark]: Boogie Preprocessor took 51.69 ms. Allocated memory is still 305.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:38,167 INFO L168 Benchmark]: RCFGBuilder took 530.79 ms. Allocated memory is still 305.7 MB. Free memory was 252.7 MB in the beginning and 235.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:38,168 INFO L168 Benchmark]: TraceAbstraction took 10259.76 ms. Allocated memory was 305.7 MB in the beginning and 535.3 MB in the end (delta: 229.6 MB). Free memory was 235.1 MB in the beginning and 370.2 MB in the end (delta: -135.1 MB). Peak memory consumption was 94.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:38,171 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 301.07 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.69 ms. Allocated memory is still 305.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 530.79 ms. Allocated memory is still 305.7 MB. Free memory was 252.7 MB in the beginning and 235.1 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10259.76 ms. Allocated memory was 305.7 MB in the beginning and 535.3 MB in the end (delta: 229.6 MB). Free memory was 235.1 MB in the beginning and 370.2 MB in the end (delta: -135.1 MB). Peak memory consumption was 94.6 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_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,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 #length - 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 #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 #memory_int - 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: 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 542]: Loop Invariant [2018-01-31 08:20:38,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,189 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-31 08:20:38,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~3,QUANTIFIED] [2018-01-31 08:20:38,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-31 08:20:38,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:20:38,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-31 08:20:38,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((\exists v_main_~nondetString~3.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~3.offset_BEFORE_CALL_2 <= s && 0 <= v_main_~nondetString~3.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_2 + unknown-#length-unknown[s] + -1]) && v_main_~nondetString~3.offset_BEFORE_CALL_2 <= 0) && (\exists main_~length~3 : int, v_main_~nondetString~3.offset_BEFORE_CALL_1 : int :: ((main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s] && 1 <= main_~length~3) && s <= v_main_~nondetString~3.offset_BEFORE_CALL_1) && unknown-#memory_int-unknown[s][main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 + -1] == 0)) && 1 == \valid[s]) || !(1 == \valid[s])) || !(\exists v_main_~nondetString~3.offset_BEFORE_CALL_2 : int :: ((0 <= v_main_~nondetString~3.offset_BEFORE_CALL_2 && v_main_~nondetString~3.offset_BEFORE_CALL_2 <= s) && 0 == unknown-#memory_int-unknown[s][v_main_~nondetString~3.offset_BEFORE_CALL_2 + unknown-#length-unknown[s] + -1]) && v_main_~nondetString~3.offset_BEFORE_CALL_2 <= 0)) || !(\exists main_~length~3 : int, v_main_~nondetString~3.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~3 && unknown-#memory_int-unknown[s][main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 + -1] == 0) && main_~length~3 + v_main_~nondetString~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s]) && s <= v_main_~nondetString~3.offset_BEFORE_CALL_1)) || !(0 == s) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 9 error locations. SAFE Result, 10.1s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 864 SDslu, 1574 SDs, 0 SdLazy, 887 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 191 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 449 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 308 ConstructedInterpolants, 23 QuantifiedInterpolants, 85995 SizeOfPredicates, 26 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 6/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-20-38-198.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-20-38-198.csv Received shutdown request...