java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:47:30,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:47:30,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:47:30,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:47:30,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:47:30,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:47:30,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:47:30,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:47:30,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:47:30,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:47:30,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:47:30,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:47:30,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:47:30,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:47:30,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:47:30,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:47:30,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:47:30,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:47:30,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:47:30,189 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:47:30,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:47:30,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:47:30,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:47:30,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:47:30,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:47:30,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:47:30,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:47:30,197 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:47:30,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:47:30,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:47:30,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:47:30,198 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:47:30,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:47:30,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:47:30,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:47:30,209 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:47:30,209 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:47:30,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:47:30,209 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:47:30,209 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:47:30,209 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:47:30,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:47:30,211 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:47:30,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:47:30,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:47:30,211 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:47:30,211 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:47:30,211 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:47:30,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:47:30,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:47:30,212 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:47:30,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:47:30,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:47:30,212 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:47:30,212 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:47:30,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:47:30,213 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:47:30,213 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:47:30,213 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:47:30,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:47:30,255 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:47:30,259 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:47:30,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:47:30,260 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:47:30,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:47:30,413 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:47:30,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:47:30,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:47:30,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:47:30,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:47:30,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626d99d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30, skipping insertion in model container [2018-01-24 11:47:30,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,442 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:47:30,479 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:47:30,598 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:47:30,615 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:47:30,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30 WrapperNode [2018-01-24 11:47:30,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:47:30,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:47:30,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:47:30,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:47:30,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... [2018-01-24 11:47:30,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:47:30,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:47:30,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:47:30,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:47:30,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:47:30,697 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:47:30,697 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:47:30,697 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-01-24 11:47:30,697 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:47:30,697 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:47:30,697 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:47:30,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:47:30,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:47:30,698 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:47:30,698 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:47:30,698 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-01-24 11:47:30,698 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:47:30,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:47:30,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:47:30,850 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:47:30,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:47:30 BoogieIcfgContainer [2018-01-24 11:47:30,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:47:30,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:47:30,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:47:30,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:47:30,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:47:30" (1/3) ... [2018-01-24 11:47:30,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b7389e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:47:30, skipping insertion in model container [2018-01-24 11:47:30,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:47:30" (2/3) ... [2018-01-24 11:47:30,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b7389e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:47:30, skipping insertion in model container [2018-01-24 11:47:30,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:47:30" (3/3) ... [2018-01-24 11:47:30,855 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:47:30,861 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:47:30,868 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 11:47:30,910 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:47:30,911 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:47:30,911 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:47:30,911 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:47:30,911 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:47:30,911 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:47:30,911 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:47:30,912 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:47:30,912 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:47:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-01-24 11:47:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 11:47:30,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:30,939 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:30,939 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-01-24 11:47:30,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:30,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:30,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:30,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:30,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:31,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:31,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:31,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:47:31,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:47:31,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:47:31,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:47:31,137 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-01-24 11:47:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:31,286 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 11:47:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:47:31,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-24 11:47:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:31,295 INFO L225 Difference]: With dead ends: 45 [2018-01-24 11:47:31,295 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 11:47:31,298 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:47:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 11:47:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 11:47:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 11:47:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-01-24 11:47:31,325 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-01-24 11:47:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:31,325 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-01-24 11:47:31,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:47:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-01-24 11:47:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 11:47:31,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:31,326 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:31,326 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-01-24 11:47:31,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:31,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:31,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:31,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:31,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:31,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:31,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:31,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:47:31,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:47:31,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:47:31,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:47:31,478 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-01-24 11:47:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:31,524 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-01-24 11:47:31,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:47:31,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-24 11:47:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:31,525 INFO L225 Difference]: With dead ends: 30 [2018-01-24 11:47:31,525 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 11:47:31,526 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 11:47:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 11:47:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 11:47:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-01-24 11:47:31,530 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-01-24 11:47:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:31,530 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-01-24 11:47:31,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:47:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-01-24 11:47:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:47:31,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:31,531 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:31,531 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-01-24 11:47:31,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:31,532 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:31,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:31,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:31,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:31,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:31,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:47:31,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:47:31,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:47:31,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:47:31,620 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-01-24 11:47:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:31,683 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-01-24 11:47:31,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:47:31,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 11:47:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:31,684 INFO L225 Difference]: With dead ends: 29 [2018-01-24 11:47:31,684 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 11:47:31,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 11:47:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-24 11:47:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 11:47:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-01-24 11:47:31,690 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-01-24 11:47:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:31,690 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-01-24 11:47:31,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:47:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-01-24 11:47:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:47:31,691 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:31,691 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:31,691 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-01-24 11:47:31,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:31,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:31,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:31,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:31,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:31,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:31,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:47:31,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:47:31,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:47:31,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:31,847 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-01-24 11:47:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:31,953 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-01-24 11:47:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:47:31,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 11:47:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:31,956 INFO L225 Difference]: With dead ends: 38 [2018-01-24 11:47:31,956 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 11:47:31,957 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 11:47:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 11:47:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-01-24 11:47:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 11:47:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-01-24 11:47:31,963 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-01-24 11:47:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:31,963 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-01-24 11:47:31,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:47:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-01-24 11:47:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:47:31,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:31,965 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:31,965 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-01-24 11:47:31,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:31,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:31,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:31,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:31,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:32,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:32,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:47:32,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:47:32,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:47:32,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:47:32,005 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-01-24 11:47:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:32,016 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-01-24 11:47:32,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:47:32,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-24 11:47:32,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:32,017 INFO L225 Difference]: With dead ends: 47 [2018-01-24 11:47:32,017 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 11:47:32,018 INFO L525 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-24 11:47:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 11:47:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 11:47:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 11:47:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-01-24 11:47:32,023 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-01-24 11:47:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:32,023 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-01-24 11:47:32,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:47:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-01-24 11:47:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:47:32,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:32,024 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:32,024 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-01-24 11:47:32,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:32,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:32,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:32,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:32,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:32,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:32,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:32,142 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:47:32,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:32,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:32,248 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 11 treesize of output 8 [2018-01-24 11:47:32,252 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 8 treesize of output 7 [2018-01-24 11:47:32,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:32,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:32,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:32,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 11:47:32,308 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 15 treesize of output 11 [2018-01-24 11:47:32,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 11:47:32,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:32,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:32,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:32,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-24 11:47:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:32,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:47:32,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2018-01-24 11:47:32,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:47:32,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:47:32,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:47:32,355 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 12 states. [2018-01-24 11:47:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:32,824 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-01-24 11:47:32,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:47:32,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-01-24 11:47:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:32,862 INFO L225 Difference]: With dead ends: 113 [2018-01-24 11:47:32,863 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 11:47:32,864 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:47:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 11:47:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2018-01-24 11:47:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 11:47:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-01-24 11:47:32,875 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2018-01-24 11:47:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:32,876 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-01-24 11:47:32,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:47:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-01-24 11:47:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:47:32,877 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:32,877 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:32,877 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash -898391046, now seen corresponding path program 1 times [2018-01-24 11:47:32,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:32,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:32,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:32,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:32,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:32,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:33,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:33,151 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:47:33,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:33,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:33,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:47:33,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:47:33,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:33,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:33,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:47:33,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:47:33,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 11:47:33,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:47:33,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:33,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:33,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:33,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 11:47:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:33,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:33,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-01-24 11:47:33,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 11:47:33,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 11:47:33,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-01-24 11:47:33,462 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 18 states. [2018-01-24 11:47:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:34,052 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-01-24 11:47:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:47:34,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-01-24 11:47:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:34,054 INFO L225 Difference]: With dead ends: 86 [2018-01-24 11:47:34,054 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 11:47:34,054 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-01-24 11:47:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 11:47:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-01-24 11:47:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 11:47:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-01-24 11:47:34,064 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-01-24 11:47:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:34,064 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-01-24 11:47:34,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 11:47:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-01-24 11:47:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:47:34,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:34,065 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:34,065 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-01-24 11:47:34,065 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:34,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:34,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:34,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:34,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:34,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:34,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:34,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:47:34,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:47:34,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:47:34,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:47:34,133 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-01-24 11:47:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:34,213 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-24 11:47:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:47:34,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 11:47:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:34,214 INFO L225 Difference]: With dead ends: 101 [2018-01-24 11:47:34,214 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 11:47:34,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:47:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 11:47:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-01-24 11:47:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 11:47:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-01-24 11:47:34,233 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-01-24 11:47:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:34,234 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-01-24 11:47:34,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:47:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-01-24 11:47:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:47:34,236 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:34,237 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:34,237 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-01-24 11:47:34,237 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:34,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:34,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:34,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:34,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:34,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:34,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:47:34,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:47:34,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:47:34,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:47:34,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:47:34,318 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2018-01-24 11:47:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:34,382 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-24 11:47:34,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:47:34,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 11:47:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:34,384 INFO L225 Difference]: With dead ends: 77 [2018-01-24 11:47:34,384 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 11:47:34,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:47:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 11:47:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 11:47:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 11:47:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-01-24 11:47:34,391 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 23 [2018-01-24 11:47:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:34,391 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-01-24 11:47:34,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:47:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-01-24 11:47:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:47:34,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:47:34,392 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:47:34,392 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 11:47:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash -698858542, now seen corresponding path program 2 times [2018-01-24 11:47:34,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:47:34,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:47:34,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:34,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:47:34,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:47:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:47:34,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:47:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:34,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:47:34,708 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:47:34,717 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:47:34,729 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:34,742 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:47:34,743 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:47:34,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:47:34,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:47:34,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:34,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:34,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:47:34,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:47:34,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:47:34,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:47:34,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:34,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:47:34,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 11:47:34,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 11:47:34,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:47:34,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:47:34,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:34,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:47:34,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 11:47:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:47:35,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:47:35,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-01-24 11:47:35,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 11:47:35,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 11:47:35,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-01-24 11:47:35,057 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 20 states. [2018-01-24 11:47:35,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:47:35,667 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-24 11:47:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 11:47:35,667 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-24 11:47:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:47:35,667 INFO L225 Difference]: With dead ends: 32 [2018-01-24 11:47:35,667 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:47:35,668 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-01-24 11:47:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:47:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:47:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:47:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:47:35,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-24 11:47:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:47:35,669 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:47:35,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 11:47:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:47:35,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:47:35,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:47:35,736 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 11:47:36,240 WARN L146 SmtUtils]: Spent 496ms on a formula simplification. DAG size of input: 120 DAG size of output 101 [2018-01-24 11:47:36,364 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,364 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:47:36,364 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,364 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 11:47:36,364 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 11:47:36,364 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 11:47:36,364 INFO L401 ceAbstractionStarter]: For program point cstrnlenFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-24 11:47:36,365 INFO L401 ceAbstractionStarter]: For program point cstrnlenErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,365 INFO L401 ceAbstractionStarter]: For program point L544''''''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 11:47:36,365 INFO L401 ceAbstractionStarter]: For program point cstrnlenEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-24 11:47:36,365 INFO L397 ceAbstractionStarter]: At program point L544'''''''(lines 544 545) the Hoare annotation is: (let ((.cse10 (select |#length| cstrnlen_~cp~2.base)) (.cse9 (div cstrnlen_~maxlen 4294967296))) (let ((.cse3 (or (<= |cstrnlen_#in~maxlen| cstrnlen_~maxlen) (< 0 .cse9))) (.cse4 (or (<= .cse9 0) (<= cstrnlen_~maxlen |cstrnlen_#in~maxlen|))) (.cse6 (<= 1 .cse10)) (.cse5 (= cstrnlen_~cp~2.offset 0)) (.cse2 (not (= (select |#valid| |cstrnlen_#in~str.base|) 1))) (.cse7 (not (= 0 |cstrnlen_#in~str.offset|))) (.cse0 (= 1 (select |#valid| cstrnlen_~cp~2.base))) (.cse1 (<= (+ cstrnlen_~cp~2.offset 1) .cse10)) (.cse8 (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (<= |cstrnlen_#in~str.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| |cstrnlen_#in~str.base|)) (= (select (select |#memory_int| |cstrnlen_#in~str.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1))) 0) (<= 1 main_~length1~4)))))) (and (or (and (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_3 Int)) (and (= (select (select |#memory_int| cstrnlen_~cp~2.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_3 (select |#length| cstrnlen_~cp~2.base) (- 1))) 0) (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_3 1) cstrnlen_~cp~2.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_3) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 0))) .cse0 .cse1) (not (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_3 Int)) (and (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 |cstrnlen_#in~str.offset|) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_3) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 0) (= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_3 (select |#length| |cstrnlen_#in~str.base|) (- 1))))))) .cse2 (and .cse3 .cse4 .cse0 .cse5 .cse6 (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_3 Int)) (and (= (select (select |#memory_int| cstrnlen_~cp~2.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_3 (select |#length| cstrnlen_~cp~2.base) (- 1))) 0) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 cstrnlen_~cp~2.offset) (<= 0 v_main_~nondetString1~4.offset_BEFORE_CALL_3) (<= v_main_~nondetString1~4.offset_BEFORE_CALL_3 0)))) .cse7 .cse8) (or (and (= 0 (select (select |#memory_int| cstrnlen_~cp~2.base) cstrnlen_~cp~2.offset)) .cse3 .cse4 .cse0 .cse5 .cse6) (or (not (= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) |cstrnlen_#in~str.offset|))) .cse2 (< (select |#length| |cstrnlen_#in~str.base|) 1) .cse7)) (or (< |cstrnlen_#in~maxlen| 1) (and (exists ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 Int) (main_~length1~4 Int)) (and (<= (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4) (select |#length| cstrnlen_~cp~2.base)) (= (select (select |#memory_int| cstrnlen_~cp~2.base) (+ v_main_~nondetString1~4.offset_BEFORE_CALL_2 main_~length1~4 (- 1))) 0) (<= cstrnlen_~cp~2.offset v_main_~nondetString1~4.offset_BEFORE_CALL_2) (<= 1 main_~length1~4))) (<= cstrnlen_~maxlen 1) (<= 1 cstrnlen_~maxlen) .cse0 .cse5) .cse2 .cse7 (< 1 |cstrnlen_#in~maxlen|) (and (<= cstrnlen_~maxlen (* 4294967296 .cse9)) .cse0 .cse1 (< 0 (+ .cse9 1)) (<= 1 cstrnlen_~cp~2.offset)) .cse8)))) [2018-01-24 11:47:36,365 INFO L401 ceAbstractionStarter]: For program point cstrnlenErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,365 INFO L404 ceAbstractionStarter]: At program point cstrnlenENTRY(lines 540 547) the Hoare annotation is: true [2018-01-24 11:47:36,365 INFO L401 ceAbstractionStarter]: For program point L544''''''(lines 544 545) no Hoare annotation was computed. [2018-01-24 11:47:36,365 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 560) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 560) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 11:47:36,366 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 560) no Hoare annotation was computed. [2018-01-24 11:47:36,367 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:47:36,367 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-24 11:47:36,367 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-24 11:47:36,367 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 11:47:36,367 INFO L397 ceAbstractionStarter]: At program point L558'(line 558) the Hoare annotation is: (let ((.cse0 (= 0 |main_#t~malloc6.offset|)) (.cse4 (= 1 (select |#valid| |main_#t~malloc6.base|))) (.cse1 (select |#length| main_~nondetString1~4.base)) (.cse2 (= main_~length1~4 (select |#length| |main_#t~malloc6.base|))) (.cse3 (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|)) (.cse5 (= 1 (select |#valid| main_~nondetString1~4.base)))) (or (and (<= 1 main_~n~4) .cse0 (exists ((main_~length1~4 Int)) (and (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~length1~4 main_~nondetString1~4.offset (- 1))) 0) (<= (+ main_~length1~4 main_~nondetString1~4.offset) (select |#length| main_~nondetString1~4.base)) (<= 1 main_~length1~4))) (= main_~length1~4 .cse1) (= 0 main_~nondetString1~4.offset) .cse2 .cse3 .cse4 (<= main_~n~4 1) .cse5) (and .cse0 .cse4 (<= 1 main_~length1~4) (= main_~nondetString1~4.offset 0) (= .cse1 main_~length1~4) (= (select (select |#memory_int| main_~nondetString1~4.base) (+ main_~nondetString1~4.offset .cse1 (- 1))) 0) .cse2 .cse3 .cse5))) [2018-01-24 11:47:36,367 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 11:47:36,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,380 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,380 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,380 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,380 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,381 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,381 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,381 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,381 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,382 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,382 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,382 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,383 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,383 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,383 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,384 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,385 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,388 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,389 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,390 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,391 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,392 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,392 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,392 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,401 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,402 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,402 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,402 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,403 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,404 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,404 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,404 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,405 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,405 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,405 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,405 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,406 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,406 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,406 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,407 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,407 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,407 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,407 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,408 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,408 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,408 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,409 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,410 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,410 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,410 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,410 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,411 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,412 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,412 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,412 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,412 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,413 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,413 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,413 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,413 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,414 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:47:36 BoogieIcfgContainer [2018-01-24 11:47:36,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:47:36,418 INFO L168 Benchmark]: Toolchain (without parser) took 6004.05 ms. Allocated memory was 300.9 MB in the beginning and 538.4 MB in the end (delta: 237.5 MB). Free memory was 260.8 MB in the beginning and 452.8 MB in the end (delta: -191.9 MB). Peak memory consumption was 169.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:36,419 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:47:36,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.27 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 249.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:36,420 INFO L168 Benchmark]: Boogie Preprocessor took 27.58 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 11:47:36,420 INFO L168 Benchmark]: RCFGBuilder took 198.87 ms. Allocated memory is still 300.9 MB. Free memory was 247.6 MB in the beginning and 232.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:36,420 INFO L168 Benchmark]: TraceAbstraction took 5566.30 ms. Allocated memory was 300.9 MB in the beginning and 538.4 MB in the end (delta: 237.5 MB). Free memory was 232.5 MB in the beginning and 452.8 MB in the end (delta: -220.3 MB). Peak memory consumption was 140.7 MB. Max. memory is 5.3 GB. [2018-01-24 11:47:36,422 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.13 ms. Allocated memory is still 300.9 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.27 ms. Allocated memory is still 300.9 MB. Free memory was 259.8 MB in the beginning and 249.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.58 ms. Allocated memory is still 300.9 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 198.87 ms. Allocated memory is still 300.9 MB. Free memory was 247.6 MB in the beginning and 232.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5566.30 ms. Allocated memory was 300.9 MB in the beginning and 538.4 MB in the end (delta: 237.5 MB). Free memory was 232.5 MB in the beginning and 452.8 MB in the end (delta: -220.3 MB). Peak memory consumption was 140.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 11:47:36,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,435 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,436 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,437 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,438 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,439 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,439 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,439 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,439 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,439 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,440 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,441 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,442 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,443 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,446 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,446 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,447 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,447 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,447 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,447 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,448 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,448 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,448 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,448 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,448 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,448 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 11:47:36,449 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,449 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,449 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,449 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,449 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,449 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,449 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,450 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,450 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,452 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,452 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,452 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 11:47:36,454 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,454 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-24 11:47:36,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,456 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 11:47:36,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:47:36,457 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_3 : int :: ((unknown-#memory_int-unknown[cp][v_main_~nondetString1~4.offset_BEFORE_CALL_3 + unknown-#length-unknown[cp] + -1] == 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_3 + 1 <= cp) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_3) && v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= 0) && 1 == \valid[cp]) && cp + 1 <= unknown-#length-unknown[cp]) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_3 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= str && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_3) && v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= 0) && 0 == unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_3 + unknown-#length-unknown[str] + -1])) || !(\valid[str] == 1)) || ((((((\old(maxlen) <= maxlen || 0 < maxlen / 4294967296) && (maxlen / 4294967296 <= 0 || maxlen <= \old(maxlen))) && 1 == \valid[cp]) && cp == 0) && 1 <= unknown-#length-unknown[cp]) && (\exists v_main_~nondetString1~4.offset_BEFORE_CALL_3 : int :: ((unknown-#memory_int-unknown[cp][v_main_~nondetString1~4.offset_BEFORE_CALL_3 + unknown-#length-unknown[cp] + -1] == 0 && v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= cp) && 0 <= v_main_~nondetString1~4.offset_BEFORE_CALL_3) && v_main_~nondetString1~4.offset_BEFORE_CALL_3 <= 0))) || !(0 == str)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((str <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[str]) && unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && 1 <= main_~length1~4)) && ((((((0 == unknown-#memory_int-unknown[cp][cp] && (\old(maxlen) <= maxlen || 0 < maxlen / 4294967296)) && (maxlen / 4294967296 <= 0 || maxlen <= \old(maxlen))) && 1 == \valid[cp]) && cp == 0) && 1 <= unknown-#length-unknown[cp]) || ((!(0 == unknown-#memory_int-unknown[str][str]) || !(\valid[str] == 1)) || unknown-#length-unknown[str] < 1) || !(0 == str))) && ((((((\old(maxlen) < 1 || (((((\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[cp] && unknown-#memory_int-unknown[cp][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && cp <= v_main_~nondetString1~4.offset_BEFORE_CALL_2) && 1 <= main_~length1~4) && maxlen <= 1) && 1 <= maxlen) && 1 == \valid[cp]) && cp == 0)) || !(\valid[str] == 1)) || !(0 == str)) || 1 < \old(maxlen)) || ((((maxlen <= 4294967296 * (maxlen / 4294967296) && 1 == \valid[cp]) && cp + 1 <= unknown-#length-unknown[cp]) && 0 < maxlen / 4294967296 + 1) && 1 <= cp)) || !(\exists v_main_~nondetString1~4.offset_BEFORE_CALL_2 : int, main_~length1~4 : int :: ((str <= v_main_~nondetString1~4.offset_BEFORE_CALL_2 && v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 <= unknown-#length-unknown[str]) && unknown-#memory_int-unknown[str][v_main_~nondetString1~4.offset_BEFORE_CALL_2 + main_~length1~4 + -1] == 0) && 1 <= main_~length1~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 5 error locations. SAFE Result, 5.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 356 SDslu, 923 SDs, 0 SdLazy, 746 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 23 NumberOfFragments, 464 HoareAnnotationTreeSize, 13 FomulaSimplifications, 383 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1031 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 251 ConstructedInterpolants, 15 QuantifiedInterpolants, 39046 SizeOfPredicates, 25 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 9/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-47-36-462.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-47-36-462.csv Received shutdown request...