java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.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-25 02:46:09,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:46:09,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:46:09,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:46:09,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:46:09,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:46:09,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:46:09,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:46:09,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:46:09,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:46:09,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:46:09,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:46:09,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:46:09,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:46:09,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:46:09,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:46:09,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:46:09,244 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:46:09,245 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:46:09,246 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:46:09,249 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:46:09,249 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:46:09,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:46:09,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:46:09,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:46:09,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:46:09,253 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:46:09,254 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:46:09,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:46:09,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:46:09,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:46:09,255 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:46:09,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:46:09,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:46:09,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:46:09,271 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:46:09,271 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:46:09,272 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:46:09,272 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:46:09,272 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:46:09,272 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:46:09,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:46:09,273 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:46:09,273 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:46:09,274 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:46:09,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:46:09,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:46:09,274 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:46:09,274 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:46:09,275 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:46:09,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:46:09,275 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:46:09,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:46:09,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:46:09,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:46:09,276 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:46:09,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:46:09,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:46:09,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:46:09,277 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:46:09,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:46:09,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:46:09,277 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:46:09,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:46:09,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:46:09,278 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:46:09,278 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:46:09,279 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:46:09,279 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:46:09,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:46:09,329 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:46:09,334 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:46:09,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:46:09,336 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:46:09,337 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-25 02:46:09,537 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:46:09,542 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:46:09,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:46:09,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:46:09,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:46:09,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a60e38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09, skipping insertion in model container [2018-01-25 02:46:09,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,572 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:46:09,614 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:46:09,731 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:46:09,746 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:46:09,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09 WrapperNode [2018-01-25 02:46:09,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:46:09,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:46:09,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:46:09,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:46:09,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (1/1) ... [2018-01-25 02:46:09,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:46:09,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:46:09,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:46:09,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:46:09,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (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-25 02:46:09,834 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:46:09,835 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:46:09,835 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-01-25 02:46:09,835 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:46:09,835 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:46:09,836 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:46:09,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:46:09,836 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:46:09,836 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:46:09,836 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:46:09,836 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-01-25 02:46:09,837 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:46:09,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:46:09,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:46:10,134 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:46:10,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:46:10 BoogieIcfgContainer [2018-01-25 02:46:10,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:46:10,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:46:10,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:46:10,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:46:10,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:46:09" (1/3) ... [2018-01-25 02:46:10,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6a1227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:46:10, skipping insertion in model container [2018-01-25 02:46:10,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:46:09" (2/3) ... [2018-01-25 02:46:10,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6a1227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:46:10, skipping insertion in model container [2018-01-25 02:46:10,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:46:10" (3/3) ... [2018-01-25 02:46:10,143 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:46:10,150 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:46:10,156 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-25 02:46:10,205 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:46:10,205 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:46:10,206 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:46:10,206 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:46:10,206 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:46:10,206 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:46:10,206 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:46:10,206 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:46:10,207 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:46:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-01-25 02:46:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:46:10,232 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:10,234 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:10,234 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:10,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-01-25 02:46:10,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:10,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:10,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:10,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:10,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:10,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:46:10,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:10,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:46:10,490 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:10,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:46:10,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:46:10,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:46:10,512 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-01-25 02:46:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:10,687 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-25 02:46:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:46:10,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-25 02:46:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:10,696 INFO L225 Difference]: With dead ends: 45 [2018-01-25 02:46:10,696 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 02:46:10,699 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-25 02:46:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 02:46:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-25 02:46:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-25 02:46:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-01-25 02:46:10,727 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-01-25 02:46:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:10,728 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-01-25 02:46:10,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:46:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-01-25 02:46:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:46:10,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:10,728 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:10,729 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:10,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-01-25 02:46:10,729 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:10,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:10,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:10,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:10,730 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:10,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:10,852 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-25 02:46:10,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:10,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:46:10,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:10,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:46:10,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:46:10,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:46:10,856 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-01-25 02:46:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:10,903 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-01-25 02:46:10,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:46:10,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-25 02:46:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:10,905 INFO L225 Difference]: With dead ends: 30 [2018-01-25 02:46:10,905 INFO L226 Difference]: Without dead ends: 29 [2018-01-25 02:46:10,906 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-25 02:46:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-25 02:46:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-25 02:46:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-25 02:46:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-01-25 02:46:10,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-01-25 02:46:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:10,912 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-01-25 02:46:10,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:46:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-01-25 02:46:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:46:10,913 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:10,913 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:10,914 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-01-25 02:46:10,914 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:10,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:10,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:10,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:10,916 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:10,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:10,986 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-25 02:46:10,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:10,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:46:10,987 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:10,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:46:10,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:46:10,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:46:10,988 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-01-25 02:46:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:11,040 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-01-25 02:46:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:46:11,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-25 02:46:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:11,042 INFO L225 Difference]: With dead ends: 29 [2018-01-25 02:46:11,042 INFO L226 Difference]: Without dead ends: 28 [2018-01-25 02:46:11,042 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-25 02:46:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-25 02:46:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-25 02:46:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 02:46:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-01-25 02:46:11,048 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-01-25 02:46:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:11,049 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-01-25 02:46:11,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:46:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-01-25 02:46:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:46:11,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:11,050 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:46:11,050 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-01-25 02:46:11,050 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:11,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:11,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:11,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:11,052 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:11,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:11,199 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-25 02:46:11,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:11,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:46:11,200 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:11,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:46:11,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:46:11,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:46:11,201 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-01-25 02:46:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:11,296 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-01-25 02:46:11,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:46:11,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-25 02:46:11,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:11,299 INFO L225 Difference]: With dead ends: 38 [2018-01-25 02:46:11,299 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 02:46:11,300 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-25 02:46:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 02:46:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-01-25 02:46:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 02:46:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-01-25 02:46:11,305 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-01-25 02:46:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:11,305 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-01-25 02:46:11,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:46:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-01-25 02:46:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:46:11,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:11,307 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-25 02:46:11,307 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:11,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-01-25 02:46:11,307 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:11,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:11,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:11,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:11,309 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:11,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:11,347 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-25 02:46:11,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:11,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:46:11,348 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:11,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:46:11,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:46:11,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:46:11,349 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-01-25 02:46:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:11,364 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-01-25 02:46:11,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:46:11,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-25 02:46:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:11,365 INFO L225 Difference]: With dead ends: 47 [2018-01-25 02:46:11,365 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 02:46:11,365 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-25 02:46:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 02:46:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-25 02:46:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 02:46:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-01-25 02:46:11,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-01-25 02:46:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:11,370 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-01-25 02:46:11,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:46:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-01-25 02:46:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:46:11,371 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:11,371 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-25 02:46:11,371 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-01-25 02:46:11,372 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:11,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:11,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:11,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:11,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:11,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:11,540 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-25 02:46:11,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:11,541 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:46:11,542 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 02:46:11,544 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [12], [13], [21], [23], [32], [35], [41], [45], [46], [47], [56], [57], [58], [60] [2018-01-25 02:46:11,618 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:46:11,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:46:20,127 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:46:20,128 INFO L268 AbstractInterpreter]: Visited 20 different actions 34 times. Merged at 7 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 02:46:20,141 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:46:20,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:20,141 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:46:20,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:20,155 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:20,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:20,222 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-25 02:46:20,225 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-25 02:46:20,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:20,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:20,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:20,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-25 02:46:20,313 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-25 02:46:20,315 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-25 02:46:20,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:20,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:20,319 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-25 02:46:20,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-25 02:46:20,339 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-25 02:46:20,340 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:46:20,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:46:20,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:46:20,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:20,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:20,379 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-25 02:46:20,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-25 02:46:20,383 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-25 02:46:20,408 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 02:46:20,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 12 [2018-01-25 02:46:20,408 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:20,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:46:20,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:46:20,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:46:20,409 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-01-25 02:46:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:20,508 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-25 02:46:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:46:20,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 02:46:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:20,510 INFO L225 Difference]: With dead ends: 68 [2018-01-25 02:46:20,510 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:46:20,510 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:46:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:46:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-01-25 02:46:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:46:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-25 02:46:20,518 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-01-25 02:46:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:20,518 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-25 02:46:20,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:46:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-25 02:46:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:46:20,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:20,520 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-25 02:46:20,520 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash 381472632, now seen corresponding path program 1 times [2018-01-25 02:46:20,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:20,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:20,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:20,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:20,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:20,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:20,684 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-25 02:46:20,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:20,685 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:46:20,685 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 02:46:20,685 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [12], [13], [21], [23], [32], [37], [41], [45], [46], [47], [56], [57], [58], [60] [2018-01-25 02:46:20,686 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:46:20,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:46:25,192 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:46:25,193 INFO L268 AbstractInterpreter]: Visited 20 different actions 34 times. Merged at 7 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 02:46:25,245 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:46:25,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:25,246 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2018-01-25 02:46:25,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:25,296 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:46:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:25,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:25,441 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-25 02:46:25,448 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-25 02:46:25,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:25,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:25,494 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-25 02:46:25,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:46:25,864 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-25 02:46:25,881 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-25 02:46:25,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:46:25,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:25,898 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-25 02:46:25,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 02:46:26,175 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-25 02:46:26,176 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:46:26,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 02:46:26,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:26,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:46:26,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:46:26,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:26,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:26,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:26,436 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 02:46:26,445 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-25 02:46:26,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:26,467 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:46:26,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:26,471 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:26,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:26,527 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-25 02:46:26,527 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:46:26,634 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-25 02:46:26,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:46:26,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9, 7, 7] total 27 [2018-01-25 02:46:26,636 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:46:26,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 02:46:26,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 02:46:26,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2018-01-25 02:46:26,637 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 15 states. [2018-01-25 02:46:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:27,771 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-01-25 02:46:27,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 02:46:27,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-01-25 02:46:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:27,773 INFO L225 Difference]: With dead ends: 120 [2018-01-25 02:46:27,773 INFO L226 Difference]: Without dead ends: 104 [2018-01-25 02:46:27,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2018-01-25 02:46:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-25 02:46:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2018-01-25 02:46:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 02:46:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-01-25 02:46:27,784 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-01-25 02:46:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:27,785 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-01-25 02:46:27,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 02:46:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-01-25 02:46:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:46:27,786 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:27,786 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-25 02:46:27,786 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-01-25 02:46:27,786 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:27,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:27,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:27,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:27,787 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:27,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:27,875 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-25 02:46:27,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:27,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:46:27,876 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:27,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:46:27,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:46:27,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:46:27,877 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-01-25 02:46:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:28,035 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-25 02:46:28,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:46:28,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 02:46:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:28,036 INFO L225 Difference]: With dead ends: 101 [2018-01-25 02:46:28,036 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 02:46:28,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:46:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 02:46:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-01-25 02:46:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 02:46:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-01-25 02:46:28,058 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-01-25 02:46:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:28,059 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-01-25 02:46:28,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:46:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-01-25 02:46:28,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:46:28,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:28,062 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-25 02:46:28,062 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-01-25 02:46:28,062 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:28,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:28,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:28,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:28,063 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:28,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:28,227 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-25 02:46:28,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:46:28,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:46:28,228 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:46:28,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:46:28,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:46:28,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:46:28,229 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2018-01-25 02:46:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:28,407 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-25 02:46:28,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:46:28,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-25 02:46:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:28,408 INFO L225 Difference]: With dead ends: 77 [2018-01-25 02:46:28,409 INFO L226 Difference]: Without dead ends: 29 [2018-01-25 02:46:28,409 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:46:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-25 02:46:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-25 02:46:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-25 02:46:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-01-25 02:46:28,415 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 23 [2018-01-25 02:46:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:28,415 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-01-25 02:46:28,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:46:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-01-25 02:46:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:46:28,416 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:46:28,416 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-25 02:46:28,416 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 02:46:28,416 INFO L82 PathProgramCache]: Analyzing trace with hash -698858542, now seen corresponding path program 1 times [2018-01-25 02:46:28,417 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:46:28,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:28,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:28,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:46:28,418 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:46:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:28,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:46:28,920 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-25 02:46:28,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:28,920 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:46:28,920 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 02:46:28,920 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [12], [13], [21], [23], [32], [37], [43], [45], [46], [47], [56], [57], [58], [60] [2018-01-25 02:46:28,921 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:46:28,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:46:31,020 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:46:31,020 INFO L268 AbstractInterpreter]: Visited 20 different actions 34 times. Merged at 7 different actions 14 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 02:46:31,032 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:46:31,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:31,032 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:46:31,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:31,043 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:31,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:31,071 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-25 02:46:31,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:31,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:31,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:46:31,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:46:31,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 02:46:31,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:31,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:31,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:31,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 02:46:31,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 02:46:31,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:46:31,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:46:31,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:31,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:31,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 02:46:31,393 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-25 02:46:31,393 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:46:32,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:46:32,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:46:32,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,063 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-25 02:46:32,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 02:46:32,212 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-25 02:46:32,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:46:32,233 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:46:32,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:46:32,236 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:46:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:46:32,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:46:32,299 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-25 02:46:32,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:46:32,306 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-25 02:46:32,308 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-25 02:46:32,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 02:46:32,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 02:46:32,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:46:32,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:46:32,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:32,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:46:32,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-01-25 02:46:32,418 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-25 02:46:32,419 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:46:32,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:46:32,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:46:32,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:46:32,640 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-25 02:46:32,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-25 02:46:32,737 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-25 02:46:32,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:46:32,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 11, 11] total 39 [2018-01-25 02:46:32,739 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:46:32,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 02:46:32,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 02:46:32,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2018-01-25 02:46:32,740 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 20 states. [2018-01-25 02:46:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:46:33,332 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-25 02:46:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 02:46:33,332 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-25 02:46:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:46:33,333 INFO L225 Difference]: With dead ends: 32 [2018-01-25 02:46:33,333 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 02:46:33,334 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=367, Invalid=2183, Unknown=0, NotChecked=0, Total=2550 [2018-01-25 02:46:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 02:46:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 02:46:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 02:46:33,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 02:46:33,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-25 02:46:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:46:33,334 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 02:46:33,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 02:46:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 02:46:33,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 02:46:33,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 02:46:33,435 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 02:46:34,364 WARN L146 SmtUtils]: Spent 920ms on a formula simplification. DAG size of input: 104 DAG size of output 86 [2018-01-25 02:46:34,508 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 50 DAG size of output 45 [2018-01-25 02:46:34,511 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point cstrnlenFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point cstrnlenErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point L544''''''''(lines 544 545) no Hoare annotation was computed. [2018-01-25 02:46:34,512 INFO L401 ceAbstractionStarter]: For program point cstrnlenEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L397 ceAbstractionStarter]: At program point L544'''''''(lines 544 545) the Hoare annotation is: (let ((.cse13 (select |#length| cstrnlen_~cp~2.base)) (.cse14 (div cstrnlen_~maxlen 4294967296))) (let ((.cse5 (select |#memory_int| |cstrnlen_#in~str.base|)) (.cse12 (select |#memory_int| cstrnlen_~cp~2.base)) (.cse8 (or (<= |cstrnlen_#in~maxlen| cstrnlen_~maxlen) (< 0 .cse14))) (.cse9 (or (<= .cse14 0) (<= cstrnlen_~maxlen |cstrnlen_#in~maxlen|))) (.cse11 (<= 1 .cse13)) (.cse10 (= cstrnlen_~cp~2.offset 0)) (.cse2 (= 1 (select |#valid| cstrnlen_~cp~2.base))) (.cse3 (<= (+ cstrnlen_~cp~2.offset 1) .cse13)) (.cse4 (<= 1 cstrnlen_~cp~2.offset)) (.cse0 (not (= (select |#valid| |cstrnlen_#in~str.base|) 1))) (.cse6 (not (= 0 |cstrnlen_#in~str.offset|))) (.cse7 (not (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_4 Int)) (and (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_4) (select |#length| |cstrnlen_#in~str.base|)) (= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_4 (- 1)))) (<= |cstrnlen_#in~str.offset| v_main_~nondetString1~4.offset_BEFORE_CALL_4) (<= 1 main_~length1~4)))))) (and (let ((.cse1 (= 0 (select .cse12 (+ .cse13 (- 1)))))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4) (not (= 0 (select .cse5 (+ (select |#length| |cstrnlen_#in~str.base|) (- 1))))) .cse6 .cse7 (and .cse8 .cse1 .cse9 .cse2 .cse10 .cse11))) (or (or (not (= 0 (select .cse5 |cstrnlen_#in~str.offset|))) .cse0 .cse6 .cse7) (and (= 0 (select .cse12 cstrnlen_~cp~2.offset)) .cse8 .cse9 .cse2 .cse10 .cse11)) (or (< |cstrnlen_#in~maxlen| 1) (and (exists ((main_~length1~4 Int) (v_main_~nondetString1~4.offset_BEFORE_CALL_4 Int)) (and (<= (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_4) (select |#length| cstrnlen_~cp~2.base)) (<= cstrnlen_~cp~2.offset v_main_~nondetString1~4.offset_BEFORE_CALL_4) (= 0 (select (select |#memory_int| cstrnlen_~cp~2.base) (+ main_~length1~4 v_main_~nondetString1~4.offset_BEFORE_CALL_4 (- 1)))) (<= 1 main_~length1~4))) (<= cstrnlen_~maxlen 1) (<= 1 cstrnlen_~maxlen) .cse2 .cse10) (and (<= cstrnlen_~maxlen (* 4294967296 .cse14)) .cse2 .cse3 (< 0 (+ .cse14 1)) .cse4) .cse0 .cse6 .cse7 (< 1 |cstrnlen_#in~maxlen|))))) [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point cstrnlenErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L404 ceAbstractionStarter]: At program point cstrnlenENTRY(lines 540 547) the Hoare annotation is: true [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point L544''''''(lines 544 545) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 548 560) no Hoare annotation was computed. [2018-01-25 02:46:34,513 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 560) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 548 560) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 548 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-25 02:46:34,514 INFO L397 ceAbstractionStarter]: At program point L558'(line 558) the Hoare annotation is: (let ((.cse0 (= 0 |main_#t~malloc6.offset|)) (.cse2 (= 0 main_~nondetString1~4.offset)) (.cse1 (select |#length| main_~nondetString1~4.base)) (.cse3 (= main_~length1~4 (select |#length| |main_#t~malloc6.base|))) (.cse4 (= (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_#t~malloc6.base|))) (.cse6 (= 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) .cse2 .cse3 .cse4 .cse5 (<= main_~n~4 1) .cse6) (and .cse0 .cse2 (= (select (select |#memory_int| main_~nondetString1~4.base) (+ .cse1 (- 1))) 0) (= .cse1 main_~length1~4) .cse3 .cse4 .cse5 .cse6 (<= 1 main_~length1~4)))) [2018-01-25 02:46:34,514 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-25 02:46:34,524 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,525 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,526 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,532 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,555 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,556 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:46:34 BoogieIcfgContainer [2018-01-25 02:46:34,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:46:34,564 INFO L168 Benchmark]: Toolchain (without parser) took 25026.85 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 859.8 MB). Free memory was 267.7 MB in the beginning and 486.8 MB in the end (delta: -219.1 MB). Peak memory consumption was 640.8 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:34,565 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:46:34,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.64 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 257.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:34,566 INFO L168 Benchmark]: Boogie Preprocessor took 30.48 ms. Allocated memory is still 308.8 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:34,566 INFO L168 Benchmark]: RCFGBuilder took 351.70 ms. Allocated memory is still 308.8 MB. Free memory was 255.7 MB in the beginning and 240.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:34,570 INFO L168 Benchmark]: TraceAbstraction took 24427.23 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 859.8 MB). Free memory was 240.7 MB in the beginning and 486.8 MB in the end (delta: -246.0 MB). Peak memory consumption was 613.8 MB. Max. memory is 5.3 GB. [2018-01-25 02:46:34,572 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.21 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.64 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 257.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.48 ms. Allocated memory is still 308.8 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 351.70 ms. Allocated memory is still 308.8 MB. Free memory was 255.7 MB in the beginning and 240.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24427.23 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 859.8 MB). Free memory was 240.7 MB in the beginning and 486.8 MB in the end (delta: -246.0 MB). Peak memory consumption was 613.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 176 LocStat_NO_SUPPORTING_DISEQUALITIES : 17 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.067871 RENAME_VARIABLES(MILLISECONDS) : 0.724062 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.004019 PROJECTAWAY(MILLISECONDS) : 3.050378 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.076822 DISJOIN(MILLISECONDS) : 0.269014 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.767540 ADD_EQUALITY(MILLISECONDS) : 0.016261 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011933 #CONJOIN_DISJUNCTIVE : 65 #RENAME_VARIABLES : 114 #UNFREEZE : 0 #CONJOIN : 110 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 101 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 168 LocStat_NO_SUPPORTING_DISEQUALITIES : 14 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.575103 RENAME_VARIABLES(MILLISECONDS) : 0.314312 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.504540 PROJECTAWAY(MILLISECONDS) : 0.424249 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.135887 DISJOIN(MILLISECONDS) : 0.301295 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.347871 ADD_EQUALITY(MILLISECONDS) : 0.021301 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013553 #CONJOIN_DISJUNCTIVE : 64 #RENAME_VARIABLES : 114 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 101 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 160 LocStat_NO_SUPPORTING_DISEQUALITIES : 14 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.195543 RENAME_VARIABLES(MILLISECONDS) : 0.264646 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.149487 PROJECTAWAY(MILLISECONDS) : 0.352694 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.035901 DISJOIN(MILLISECONDS) : 0.300325 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.295921 ADD_EQUALITY(MILLISECONDS) : 0.014069 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009048 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 114 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 101 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_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[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_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[main_~length1~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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-25 02:46:34,612 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,613 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,614 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,615 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,626 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,627 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,630 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,631 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,632 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:46:34,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~4,QUANTIFIED] [2018-01-25 02:46:34,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 02:46:34,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:46:34,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((!(\valid[str] == 1) || (((0 == unknown-#memory_int-unknown[cp][unknown-#length-unknown[cp] + -1] && 1 == \valid[cp]) && cp + 1 <= unknown-#length-unknown[cp]) && 1 <= cp)) || !(0 == unknown-#memory_int-unknown[str][unknown-#length-unknown[str] + -1])) || !(0 == str)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_4 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= unknown-#length-unknown[str] && 0 == unknown-#memory_int-unknown[str][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 + -1]) && str <= v_main_~nondetString1~4.offset_BEFORE_CALL_4) && 1 <= main_~length1~4)) || ((((((\old(maxlen) <= maxlen || 0 < maxlen / 4294967296) && 0 == unknown-#memory_int-unknown[cp][unknown-#length-unknown[cp] + -1]) && (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)) || !(0 == str)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_4 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= unknown-#length-unknown[str] && 0 == unknown-#memory_int-unknown[str][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 + -1]) && str <= v_main_~nondetString1~4.offset_BEFORE_CALL_4) && 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]))) && ((((((\old(maxlen) < 1 || (((((\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_4 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= unknown-#length-unknown[cp] && cp <= v_main_~nondetString1~4.offset_BEFORE_CALL_4) && 0 == unknown-#memory_int-unknown[cp][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 + -1]) && 1 <= main_~length1~4) && maxlen <= 1) && 1 <= maxlen) && 1 == \valid[cp]) && cp == 0)) || ((((maxlen <= 4294967296 * (maxlen / 4294967296) && 1 == \valid[cp]) && cp + 1 <= unknown-#length-unknown[cp]) && 0 < maxlen / 4294967296 + 1) && 1 <= cp)) || !(\valid[str] == 1)) || !(0 == str)) || !(\exists main_~length1~4 : int, v_main_~nondetString1~4.offset_BEFORE_CALL_4 : int :: ((main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 <= unknown-#length-unknown[str] && 0 == unknown-#memory_int-unknown[str][main_~length1~4 + v_main_~nondetString1~4.offset_BEFORE_CALL_4 + -1]) && str <= v_main_~nondetString1~4.offset_BEFORE_CALL_4) && 1 <= main_~length1~4)) || 1 < \old(maxlen)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 5 error locations. SAFE Result, 24.3s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 254 SDtfs, 313 SDslu, 826 SDs, 0 SdLazy, 670 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 195 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 4.7s 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, 15.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 23 NumberOfFragments, 448 HoareAnnotationTreeSize, 13 FomulaSimplifications, 541 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 972 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 416 ConstructedInterpolants, 23 QuantifiedInterpolants, 81073 SizeOfPredicates, 49 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 15/86 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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-46-34-663.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-46-34-663.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-46-34-663.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_02-46-34-663.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_02-46-34-663.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_02-46-34-663.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_02-46-34-663.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-46-34-663.csv Received shutdown request...