java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:09:12,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:09:12,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:09:12,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:09:12,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:09:12,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:09:12,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:09:12,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:09:12,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:09:12,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:09:12,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:09:12,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:09:12,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:09:12,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:09:12,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:09:12,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:09:12,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:09:12,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:09:12,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:09:12,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:09:12,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:09:12,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:09:12,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:09:12,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:09:12,626 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:09:12,627 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:09:12,627 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:09:12,628 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:09:12,628 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:09:12,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:09:12,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:09:12,629 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:09:12,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:09:12,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:09:12,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:09:12,640 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:09:12,641 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:09:12,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:09:12,641 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:09:12,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:09:12,642 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:09:12,642 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:09:12,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:09:12,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:09:12,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:09:12,643 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:09:12,643 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:09:12,643 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:09:12,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:09:12,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:09:12,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:09:12,644 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:09:12,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:09:12,644 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:09:12,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:09:12,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:09:12,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:09:12,645 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:09:12,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:09:12,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:09:12,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:09:12,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:09:12,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:09:12,646 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:09:12,647 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:09:12,647 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:09:12,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:09:12,693 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:09:12,697 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:09:12,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:09:12,725 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:09:12,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:09:12,903 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:09:12,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:09:12,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:09:12,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:09:12,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:09:12,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:09:12" (1/1) ... [2018-01-28 21:09:12,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6f32fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:12, skipping insertion in model container [2018-01-28 21:09:12,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:09:12" (1/1) ... [2018-01-28 21:09:12,935 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:09:12,977 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:09:13,090 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:09:13,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:09:13,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13 WrapperNode [2018-01-28 21:09:13,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:09:13,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:09:13,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:09:13,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:09:13,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (1/1) ... [2018-01-28 21:09:13,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (1/1) ... [2018-01-28 21:09:13,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (1/1) ... [2018-01-28 21:09:13,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (1/1) ... [2018-01-28 21:09:13,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (1/1) ... [2018-01-28 21:09:13,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (1/1) ... [2018-01-28 21:09:13,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (1/1) ... [2018-01-28 21:09:13,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:09:13,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:09:13,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:09:13,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:09:13,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (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-28 21:09:13,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:09:13,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:09:13,191 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-28 21:09:13,191 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:09:13,191 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:09:13,191 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:09:13,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:09:13,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:09:13,191 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:09:13,192 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:09:13,192 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-28 21:09:13,192 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:09:13,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:09:13,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:09:13,432 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:09:13,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:09:13 BoogieIcfgContainer [2018-01-28 21:09:13,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:09:13,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:09:13,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:09:13,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:09:13,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:09:12" (1/3) ... [2018-01-28 21:09:13,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a767dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:09:13, skipping insertion in model container [2018-01-28 21:09:13,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:09:13" (2/3) ... [2018-01-28 21:09:13,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a767dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:09:13, skipping insertion in model container [2018-01-28 21:09:13,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:09:13" (3/3) ... [2018-01-28 21:09:13,441 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:09:13,449 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:09:13,454 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 21:09:13,500 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:09:13,500 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:09:13,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:09:13,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:09:13,501 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:09:13,501 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:09:13,501 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:09:13,501 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:09:13,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:09:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-28 21:09:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:09:13,530 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:13,532 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:13,532 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash -882755986, now seen corresponding path program 1 times [2018-01-28 21:09:13,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:13,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:13,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:13,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:13,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:13,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:13,776 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-28 21:09:13,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:13,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:09:13,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:09:13,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:09:13,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:09:13,801 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 4 states. [2018-01-28 21:09:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:14,020 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-01-28 21:09:14,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:09:14,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:09:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:14,033 INFO L225 Difference]: With dead ends: 108 [2018-01-28 21:09:14,034 INFO L226 Difference]: Without dead ends: 78 [2018-01-28 21:09:14,037 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:09:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-28 21:09:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-28 21:09:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-28 21:09:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-28 21:09:14,081 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 19 [2018-01-28 21:09:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:14,082 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-28 21:09:14,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:09:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-28 21:09:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:09:14,083 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:14,083 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:14,083 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash -882755985, now seen corresponding path program 1 times [2018-01-28 21:09:14,084 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:14,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:14,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:14,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:14,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:14,243 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-28 21:09:14,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:14,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:09:14,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:09:14,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:09:14,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:09:14,245 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2018-01-28 21:09:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:14,334 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-01-28 21:09:14,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:09:14,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-28 21:09:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:14,335 INFO L225 Difference]: With dead ends: 78 [2018-01-28 21:09:14,335 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 21:09:14,336 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:09:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 21:09:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-28 21:09:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 21:09:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-28 21:09:14,343 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 19 [2018-01-28 21:09:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:14,343 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-28 21:09:14,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:09:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-28 21:09:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:09:14,344 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:14,344 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:14,344 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1595631731, now seen corresponding path program 1 times [2018-01-28 21:09:14,344 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:14,344 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:14,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:14,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:14,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:14,380 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-28 21:09:14,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:14,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:09:14,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:09:14,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:09:14,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:09:14,382 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 4 states. [2018-01-28 21:09:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:14,455 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-28 21:09:14,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:09:14,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:09:14,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:14,456 INFO L225 Difference]: With dead ends: 77 [2018-01-28 21:09:14,457 INFO L226 Difference]: Without dead ends: 76 [2018-01-28 21:09:14,457 INFO L533 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-28 21:09:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-28 21:09:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-28 21:09:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 21:09:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-28 21:09:14,465 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 20 [2018-01-28 21:09:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:14,465 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-28 21:09:14,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:09:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-28 21:09:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:09:14,466 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:14,466 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:14,466 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1595631730, now seen corresponding path program 1 times [2018-01-28 21:09:14,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:14,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:14,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:14,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:14,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:14,550 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-28 21:09:14,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:14,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:09:14,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:09:14,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:09:14,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:09:14,552 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2018-01-28 21:09:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:14,591 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-28 21:09:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:09:14,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 21:09:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:14,593 INFO L225 Difference]: With dead ends: 76 [2018-01-28 21:09:14,593 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 21:09:14,594 INFO L533 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-28 21:09:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 21:09:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-28 21:09:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 21:09:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-28 21:09:14,602 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 20 [2018-01-28 21:09:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:14,602 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-28 21:09:14,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:09:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-28 21:09:14,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 21:09:14,603 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:14,603 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:14,604 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:14,604 INFO L82 PathProgramCache]: Analyzing trace with hash -299931518, now seen corresponding path program 1 times [2018-01-28 21:09:14,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:14,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:14,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:14,605 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:14,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:14,660 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-28 21:09:14,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:14,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:09:14,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:09:14,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:09:14,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:09:14,661 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2018-01-28 21:09:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:14,740 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-01-28 21:09:14,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:09:14,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-28 21:09:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:14,744 INFO L225 Difference]: With dead ends: 81 [2018-01-28 21:09:14,744 INFO L226 Difference]: Without dead ends: 79 [2018-01-28 21:09:14,745 INFO L533 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-28 21:09:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-28 21:09:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-01-28 21:09:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 21:09:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-28 21:09:14,753 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 25 [2018-01-28 21:09:14,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:14,753 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-28 21:09:14,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:09:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-28 21:09:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 21:09:14,755 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:14,755 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:14,755 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash -299931517, now seen corresponding path program 1 times [2018-01-28 21:09:14,756 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:14,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:14,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:14,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:14,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:14,886 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-28 21:09:14,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:14,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:09:14,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:09:14,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:09:14,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:09:14,887 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 8 states. [2018-01-28 21:09:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:15,005 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-01-28 21:09:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:09:15,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-28 21:09:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:15,007 INFO L225 Difference]: With dead ends: 104 [2018-01-28 21:09:15,007 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 21:09:15,007 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:09:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 21:09:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-01-28 21:09:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:09:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-28 21:09:15,015 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 25 [2018-01-28 21:09:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:15,015 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-28 21:09:15,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:09:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-28 21:09:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:09:15,017 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:15,017 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:15,017 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1727893906, now seen corresponding path program 1 times [2018-01-28 21:09:15,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:15,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:15,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:15,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:15,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:15,078 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-28 21:09:15,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:15,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:09:15,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:09:15,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:09:15,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:09:15,079 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 6 states. [2018-01-28 21:09:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:15,161 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-28 21:09:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:09:15,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-28 21:09:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:15,163 INFO L225 Difference]: With dead ends: 84 [2018-01-28 21:09:15,163 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:09:15,163 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:09:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:09:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 21:09:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 21:09:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-28 21:09:15,169 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 28 [2018-01-28 21:09:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:15,169 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-28 21:09:15,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:09:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-28 21:09:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 21:09:15,171 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:15,171 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:15,171 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1727893905, now seen corresponding path program 1 times [2018-01-28 21:09:15,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:15,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:15,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:15,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:15,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:15,303 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-28 21:09:15,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:15,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:09:15,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:09:15,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:09:15,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:09:15,305 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 9 states. [2018-01-28 21:09:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:15,495 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-28 21:09:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:09:15,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-28 21:09:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:15,496 INFO L225 Difference]: With dead ends: 86 [2018-01-28 21:09:15,496 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:09:15,496 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:09:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:09:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-01-28 21:09:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 21:09:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-28 21:09:15,501 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 28 [2018-01-28 21:09:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:15,502 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-28 21:09:15,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:09:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-28 21:09:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 21:09:15,504 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:15,504 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:15,504 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -179741680, now seen corresponding path program 1 times [2018-01-28 21:09:15,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:15,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:15,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:15,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:15,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:15,562 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-28 21:09:15,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:15,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:09:15,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:09:15,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:09:15,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:09:15,565 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 4 states. [2018-01-28 21:09:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:15,631 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-01-28 21:09:15,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:09:15,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-28 21:09:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:15,633 INFO L225 Difference]: With dead ends: 83 [2018-01-28 21:09:15,633 INFO L226 Difference]: Without dead ends: 81 [2018-01-28 21:09:15,634 INFO L533 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-28 21:09:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-28 21:09:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-28 21:09:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 21:09:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-01-28 21:09:15,640 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 35 [2018-01-28 21:09:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:15,640 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-01-28 21:09:15,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:09:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-01-28 21:09:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 21:09:15,642 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:15,642 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:15,642 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash -179741679, now seen corresponding path program 1 times [2018-01-28 21:09:15,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:15,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:15,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:15,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:15,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:15,723 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-28 21:09:15,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:15,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:09:15,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:09:15,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:09:15,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:09:15,725 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 8 states. [2018-01-28 21:09:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:15,838 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-01-28 21:09:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:09:15,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-28 21:09:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:15,840 INFO L225 Difference]: With dead ends: 102 [2018-01-28 21:09:15,840 INFO L226 Difference]: Without dead ends: 101 [2018-01-28 21:09:15,840 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:09:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-28 21:09:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-01-28 21:09:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 21:09:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-01-28 21:09:15,846 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 35 [2018-01-28 21:09:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:15,846 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-01-28 21:09:15,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:09:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-01-28 21:09:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:09:15,847 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:15,847 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:15,847 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1690931020, now seen corresponding path program 1 times [2018-01-28 21:09:15,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:15,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:15,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:15,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:15,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:15,906 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-28 21:09:15,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:15,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:09:15,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:09:15,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:09:15,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:09:15,917 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 7 states. [2018-01-28 21:09:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:16,037 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-01-28 21:09:16,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:09:16,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-01-28 21:09:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:16,038 INFO L225 Difference]: With dead ends: 87 [2018-01-28 21:09:16,038 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 21:09:16,038 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:09:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 21:09:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-28 21:09:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 21:09:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-28 21:09:16,043 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 36 [2018-01-28 21:09:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:16,043 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-28 21:09:16,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:09:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-28 21:09:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:09:16,044 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:16,044 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:16,044 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1690931019, now seen corresponding path program 1 times [2018-01-28 21:09:16,044 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:16,044 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:16,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:16,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:16,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:16,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:16,193 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-28 21:09:16,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:16,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 21:09:16,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:09:16,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:09:16,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:09:16,194 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 12 states. [2018-01-28 21:09:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:16,460 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-01-28 21:09:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:09:16,461 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-01-28 21:09:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:16,462 INFO L225 Difference]: With dead ends: 103 [2018-01-28 21:09:16,462 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 21:09:16,463 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:09:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 21:09:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2018-01-28 21:09:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 21:09:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-28 21:09:16,468 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 36 [2018-01-28 21:09:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:16,469 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-28 21:09:16,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:09:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-28 21:09:16,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:09:16,470 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:16,471 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:16,471 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash 168805214, now seen corresponding path program 1 times [2018-01-28 21:09:16,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:16,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:16,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:16,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:16,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:16,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:16,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:09:16,717 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:09:16,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:16,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:09:16,803 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-28 21:09:16,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:16,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:16,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:09:16,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:16,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:16,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:09:16,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:16,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:16,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 21:09:16,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-01-28 21:09:16,971 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-28 21:09:16,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:16,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:16,980 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-28 21:09:16,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 21:09:17,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-28 21:09:17,029 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-28 21:09:17,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:17,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:17,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-28 21:09:17,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-28 21:09:17,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-28 21:09:17,336 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 8 treesize of output 1 [2018-01-28 21:09:17,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:17,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-28 21:09:17,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:09:17,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:09:17,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:09:17,374 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-28 21:09:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:17,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:09:17,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2018-01-28 21:09:17,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 21:09:17,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 21:09:17,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:09:17,502 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 25 states. [2018-01-28 21:09:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:19,503 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-01-28 21:09:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 21:09:19,504 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2018-01-28 21:09:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:19,504 INFO L225 Difference]: With dead ends: 128 [2018-01-28 21:09:19,504 INFO L226 Difference]: Without dead ends: 126 [2018-01-28 21:09:19,505 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=1340, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:09:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-28 21:09:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2018-01-28 21:09:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-28 21:09:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-01-28 21:09:19,513 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-01-28 21:09:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:19,513 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-01-28 21:09:19,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 21:09:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-01-28 21:09:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 21:09:19,514 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:19,514 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:19,515 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:19,515 INFO L82 PathProgramCache]: Analyzing trace with hash -530619980, now seen corresponding path program 1 times [2018-01-28 21:09:19,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:19,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:19,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:19,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:19,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:19,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:19,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:09:19,803 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:09:19,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:19,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:09:19,840 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-28 21:09:19,841 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-28 21:09:19,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:19,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:19,849 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-28 21:09:19,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:09:20,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-28 21:09:20,224 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 27 treesize of output 20 [2018-01-28 21:09:20,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:20,240 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 20 treesize of output 18 [2018-01-28 21:09:20,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:09:20,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-28 21:09:20,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 21:09:20,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:09:20,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:09:20,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-28 21:09:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:20,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:09:20,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2018-01-28 21:09:20,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 21:09:20,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 21:09:20,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-01-28 21:09:20,365 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 27 states. [2018-01-28 21:09:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:21,854 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-28 21:09:21,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 21:09:21,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-28 21:09:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:21,855 INFO L225 Difference]: With dead ends: 107 [2018-01-28 21:09:21,855 INFO L226 Difference]: Without dead ends: 106 [2018-01-28 21:09:21,855 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=248, Invalid=1822, Unknown=0, NotChecked=0, Total=2070 [2018-01-28 21:09:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-28 21:09:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-01-28 21:09:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-28 21:09:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-28 21:09:21,863 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 43 [2018-01-28 21:09:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:21,863 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-28 21:09:21,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 21:09:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-28 21:09:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:09:21,865 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:21,865 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:21,865 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:21,865 INFO L82 PathProgramCache]: Analyzing trace with hash -787380921, now seen corresponding path program 1 times [2018-01-28 21:09:21,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:21,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:21,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:21,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:21,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:21,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:22,001 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-28 21:09:22,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:09:22,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:09:22,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:09:22,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:09:22,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:09:22,002 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 6 states. [2018-01-28 21:09:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:22,116 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-01-28 21:09:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:09:22,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-28 21:09:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:22,117 INFO L225 Difference]: With dead ends: 102 [2018-01-28 21:09:22,117 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 21:09:22,117 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:09:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 21:09:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-28 21:09:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 21:09:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-28 21:09:22,121 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 49 [2018-01-28 21:09:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:22,121 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-28 21:09:22,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:09:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-28 21:09:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:09:22,122 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:22,122 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:22,122 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1414127316, now seen corresponding path program 1 times [2018-01-28 21:09:22,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:22,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:22,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:22,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:22,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:22,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:22,233 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-28 21:09:22,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:09:22,233 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:09:22,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:22,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:09:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:22,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:09:22,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 11 [2018-01-28 21:09:22,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:09:22,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:09:22,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:09:22,294 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 12 states. [2018-01-28 21:09:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:22,408 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-28 21:09:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:09:22,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-01-28 21:09:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:22,409 INFO L225 Difference]: With dead ends: 77 [2018-01-28 21:09:22,409 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 21:09:22,409 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:09:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 21:09:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-28 21:09:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-28 21:09:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-01-28 21:09:22,415 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 50 [2018-01-28 21:09:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:22,415 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-01-28 21:09:22,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:09:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-01-28 21:09:22,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 21:09:22,416 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:22,416 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:22,416 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:22,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1302180102, now seen corresponding path program 1 times [2018-01-28 21:09:22,416 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:22,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:22,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:22,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:22,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:22,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:22,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:09:22,555 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-28 21:09:22,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:22,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:09:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:22,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:09:22,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 15 [2018-01-28 21:09:22,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 21:09:22,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 21:09:22,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:09:22,644 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 16 states. [2018-01-28 21:09:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:22,862 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-01-28 21:09:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 21:09:22,863 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-01-28 21:09:22,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:22,863 INFO L225 Difference]: With dead ends: 70 [2018-01-28 21:09:22,863 INFO L226 Difference]: Without dead ends: 62 [2018-01-28 21:09:22,864 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:09:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-28 21:09:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-28 21:09:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-28 21:09:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-01-28 21:09:22,869 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 51 [2018-01-28 21:09:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:22,869 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-01-28 21:09:22,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 21:09:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-01-28 21:09:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 21:09:22,870 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:22,870 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:22,870 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash -806815965, now seen corresponding path program 2 times [2018-01-28 21:09:22,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:22,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:22,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:22,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:09:22,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:22,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:23,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:09:23,336 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:09:23,341 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:09:23,352 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:09:23,360 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:09:23,364 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:09:23,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:09:23,375 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-28 21:09:23,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,380 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-28 21:09:23,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:09:23,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:23,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-28 21:09:23,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:23,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:23,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:09:23,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-28 21:09:23,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-01-28 21:09:23,490 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-28 21:09:23,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,497 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-28 21:09:23,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-28 21:09:23,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-28 21:09:23,531 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-28 21:09:23,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:23,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 21:09:23,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-28 21:09:24,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-28 21:09:24,021 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 18 treesize of output 15 [2018-01-28 21:09:24,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:09:24,029 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 10 treesize of output 1 [2018-01-28 21:09:24,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:24,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:09:24,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:09:24,044 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-28 21:09:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:24,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:09:24,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2018-01-28 21:09:24,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 21:09:24,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 21:09:24,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:09:24,171 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 33 states. [2018-01-28 21:09:30,824 WARN L146 SmtUtils]: Spent 6100ms on a formula simplification. DAG size of input: 74 DAG size of output 49 [2018-01-28 21:09:37,171 WARN L146 SmtUtils]: Spent 5043ms on a formula simplification. DAG size of input: 72 DAG size of output 52 [2018-01-28 21:09:45,304 WARN L146 SmtUtils]: Spent 8092ms on a formula simplification. DAG size of input: 77 DAG size of output 58 [2018-01-28 21:09:49,064 WARN L146 SmtUtils]: Spent 3673ms on a formula simplification. DAG size of input: 50 DAG size of output 47 [2018-01-28 21:09:52,778 WARN L146 SmtUtils]: Spent 3611ms on a formula simplification. DAG size of input: 51 DAG size of output 48 [2018-01-28 21:09:53,157 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 67 DAG size of output 60 [2018-01-28 21:09:56,328 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 61 DAG size of output 56 [2018-01-28 21:09:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:09:56,401 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-01-28 21:09:56,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:09:56,401 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-01-28 21:09:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:09:56,402 INFO L225 Difference]: With dead ends: 68 [2018-01-28 21:09:56,402 INFO L226 Difference]: Without dead ends: 67 [2018-01-28 21:09:56,403 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=290, Invalid=2259, Unknown=1, NotChecked=0, Total=2550 [2018-01-28 21:09:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-28 21:09:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2018-01-28 21:09:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 21:09:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-28 21:09:56,410 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 55 [2018-01-28 21:09:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:09:56,410 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-28 21:09:56,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 21:09:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-28 21:09:56,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 21:09:56,411 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:09:56,411 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:09:56,411 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:09:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1217471537, now seen corresponding path program 2 times [2018-01-28 21:09:56,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:09:56,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:09:56,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:56,412 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:09:56,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:09:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:09:56,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:09:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:57,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:09:57,022 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:09:57,029 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:09:57,040 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:09:57,048 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:09:57,050 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:09:57,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:09:57,116 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-28 21:09:57,118 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-28 21:09:57,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:57,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:09:57,125 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-28 21:09:57,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-28 21:09:58,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 46 [2018-01-28 21:09:58,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2018-01-28 21:09:58,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:09:58,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:58,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2018-01-28 21:09:58,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:09:58,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:58,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:09:58,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 72 [2018-01-28 21:09:58,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-01-28 21:09:58,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:09:58,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:09:58,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:72 [2018-01-28 21:09:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:09:58,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:09:58,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 41 [2018-01-28 21:09:58,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-28 21:09:58,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-28 21:09:58,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 21:09:58,476 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 42 states. [2018-01-28 21:10:00,885 WARN L146 SmtUtils]: Spent 2032ms on a formula simplification. DAG size of input: 37 DAG size of output 37 [2018-01-28 21:10:01,677 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 94 DAG size of output 68 [2018-01-28 21:10:03,062 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 91 DAG size of output 80 [2018-01-28 21:10:03,281 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 79 DAG size of output 65 [2018-01-28 21:10:03,486 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 95 DAG size of output 70 [2018-01-28 21:10:03,683 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 96 DAG size of output 71 [2018-01-28 21:10:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:04,374 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-01-28 21:10:04,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-28 21:10:04,375 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 58 [2018-01-28 21:10:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:04,376 INFO L225 Difference]: With dead ends: 80 [2018-01-28 21:10:04,376 INFO L226 Difference]: Without dead ends: 79 [2018-01-28 21:10:04,377 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=448, Invalid=5102, Unknown=0, NotChecked=0, Total=5550 [2018-01-28 21:10:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-28 21:10:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-01-28 21:10:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 21:10:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-01-28 21:10:04,385 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 58 [2018-01-28 21:10:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:04,385 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-01-28 21:10:04,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-28 21:10:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-01-28 21:10:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 21:10:04,386 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:04,386 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:04,386 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1319012436, now seen corresponding path program 3 times [2018-01-28 21:10:04,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:04,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:04,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:04,387 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:10:04,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:04,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-28 21:10:04,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:04,716 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:10:04,721 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:10:04,734 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:10:04,739 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:10:04,744 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:10:04,750 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:10:04,752 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:10:04,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:04,793 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-28 21:10:04,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:04,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:04,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-28 21:10:04,839 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-28 21:10:04,841 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-28 21:10:04,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:04,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:04,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:04,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-28 21:10:05,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-01-28 21:10:05,389 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 28 treesize of output 26 [2018-01-28 21:10:05,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:10:05,406 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 15 treesize of output 8 [2018-01-28 21:10:05,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:05,408 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 20 treesize of output 15 [2018-01-28 21:10:05,408 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:05,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-01-28 21:10:05,434 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 21:10:05,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:10:05,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:10:05,457 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:40, output treesize:59 [2018-01-28 21:10:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:05,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:10:05,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24] total 37 [2018-01-28 21:10:05,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-28 21:10:05,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-28 21:10:05,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 21:10:05,562 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 38 states. [2018-01-28 21:10:06,623 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 58 DAG size of output 49 [2018-01-28 21:10:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:07,860 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-01-28 21:10:07,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-28 21:10:07,860 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-01-28 21:10:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:07,860 INFO L225 Difference]: With dead ends: 85 [2018-01-28 21:10:07,860 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:10:07,862 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=858, Invalid=7152, Unknown=0, NotChecked=0, Total=8010 [2018-01-28 21:10:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:10:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:10:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:10:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:10:07,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-01-28 21:10:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:07,863 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:10:07,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-28 21:10:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:10:07,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:10:07,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:10:19,060 WARN L146 SmtUtils]: Spent 11076ms on a formula simplification. DAG size of input: 209 DAG size of output 138 [2018-01-28 21:10:21,089 WARN L146 SmtUtils]: Spent 2025ms on a formula simplification. DAG size of input: 117 DAG size of output 1 [2018-01-28 21:10:21,187 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,187 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,187 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:10:21,187 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,187 INFO L399 ceAbstractionStarter]: For program point L546''''''(line 546) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point L546'''''(line 546) no Hoare annotation was computed. [2018-01-28 21:10:21,188 INFO L399 ceAbstractionStarter]: For program point L543''''''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point L543'''''''''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point L544'''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr9RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr7RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,189 INFO L399 ceAbstractionStarter]: For program point L543'''''''''''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr4RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point cstrcmpEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point L543'''''''''''''(lines 543 545) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr6RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,190 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,191 INFO L399 ceAbstractionStarter]: For program point L543''''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,191 INFO L399 ceAbstractionStarter]: For program point L543'''''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,191 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr5RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,191 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,191 INFO L399 ceAbstractionStarter]: For program point cstrcmpFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-28 21:10:21,191 INFO L402 ceAbstractionStarter]: At program point cstrcmpENTRY(lines 540 547) the Hoare annotation is: true [2018-01-28 21:10:21,191 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr8RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,191 INFO L399 ceAbstractionStarter]: For program point cstrcmpErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,192 INFO L395 ceAbstractionStarter]: At program point L543''''''''''''(lines 543 545) the Hoare annotation is: (let ((.cse8 (select |#memory_int| cstrcmp_~s2.base)) (.cse7 (select |#length| cstrcmp_~s2.base))) (let ((.cse4 (select .cse8 (+ .cse7 (- 1))))) (let ((.cse0 (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base))) (.cse1 (= 1 (select |#valid| cstrcmp_~s1.base))) (.cse2 (= 1 (select |#valid| cstrcmp_~s2.base))) (.cse3 (exists ((main_~nondetString1~3.offset Int)) (and (<= main_~nondetString1~3.offset 0) (<= 0 main_~nondetString1~3.offset) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) (+ (select |#length| cstrcmp_~s1.base) main_~nondetString1~3.offset (- 1))))))) (.cse6 (= .cse4 0)) (.cse5 (<= (+ cstrcmp_~s2.offset 1) .cse7))) (or (and .cse0 .cse1 .cse2 (<= 2 cstrcmp_~s1.offset) .cse3 (= 0 .cse4) .cse5 (<= 2 cstrcmp_~s2.offset)) (not (= 0 |cstrcmp_#in~s2.offset|)) (not (= (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ (select |#length| |cstrcmp_#in~s2.base|) (- 1))) 0)) (not (exists ((main_~nondetString1~3.offset Int)) (and (<= main_~nondetString1~3.offset 0) (<= 0 main_~nondetString1~3.offset) (= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) (+ (select |#length| |cstrcmp_#in~s1.base|) main_~nondetString1~3.offset (- 1))))))) (not (= 1 (select |#valid| |cstrcmp_#in~s2.base|))) (not (exists ((main_~nondetString2~3.base Int) (main_~nondetString2~3.offset Int)) (and (= (select (select |#memory_int| main_~nondetString2~3.base) (+ (select |#length| main_~nondetString2~3.base) main_~nondetString2~3.offset (- 1))) 0) (not (= main_~nondetString2~3.base |cstrcmp_#in~s1.base|))))) (not (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_1) (select |#length| |cstrcmp_#in~s1.base|)) (<= |cstrcmp_#in~s1.offset| v_main_~nondetString1~3.offset_BEFORE_CALL_1) (= (select (select |#memory_int| |cstrcmp_#in~s1.base|) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length1~3)))) (and .cse1 (exists ((main_~length1~3 Int) (v_main_~nondetString1~3.offset_BEFORE_CALL_1 Int)) (and (<= cstrcmp_~s1.offset v_main_~nondetString1~3.offset_BEFORE_CALL_1) (<= (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_1) (select |#length| cstrcmp_~s1.base)) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) (+ main_~length1~3 v_main_~nondetString1~3.offset_BEFORE_CALL_1 (- 1)))) (<= 1 main_~length1~3))) .cse2 (= 0 cstrcmp_~s2.offset) (= 0 cstrcmp_~s1.offset) .cse3 (exists ((main_~length2~3 Int) (v_main_~nondetString2~3.offset_BEFORE_CALL_1 Int)) (and (<= cstrcmp_~s2.offset v_main_~nondetString2~3.offset_BEFORE_CALL_1) (= (select (select |#memory_int| cstrcmp_~s2.base) (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length2~3) (<= (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_1) (select |#length| cstrcmp_~s2.base)))) .cse6) (not (= (select |#valid| |cstrcmp_#in~s1.base|) 1)) (not (= |cstrcmp_#in~s1.offset| 0)) (let ((.cse9 (select (select |#memory_int| cstrcmp_~s1.base) 0))) (and .cse0 .cse1 (or (<= (+ cstrcmp_~s2.offset 2) .cse7) (<= cstrcmp_~s2.offset 1)) (<= 1 cstrcmp_~s2.offset) .cse2 (= (select .cse8 (+ cstrcmp_~s2.offset (- 1))) .cse9) (not (= .cse9 0)) .cse3 .cse6 (exists ((main_~nondetString2~3.base Int) (main_~nondetString2~3.offset Int)) (and (not (= cstrcmp_~s1.base main_~nondetString2~3.base)) (= (select (select |#memory_int| main_~nondetString2~3.base) (+ (select |#length| main_~nondetString2~3.base) main_~nondetString2~3.offset (- 1))) 0))) .cse5 (= cstrcmp_~s1.offset 1))) (not (exists ((main_~length2~3 Int) (v_main_~nondetString2~3.offset_BEFORE_CALL_2 Int)) (and (<= |cstrcmp_#in~s2.offset| v_main_~nondetString2~3.offset_BEFORE_CALL_2) (<= 1 main_~length2~3) (<= (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_2) (select |#length| |cstrcmp_#in~s2.base|)) (= (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ main_~length2~3 v_main_~nondetString2~3.offset_BEFORE_CALL_2 (- 1))) 0)))))))) [2018-01-28 21:10:21,192 INFO L399 ceAbstractionStarter]: For program point L543''''''''''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,192 INFO L399 ceAbstractionStarter]: For program point L543'''''''(line 543) no Hoare annotation was computed. [2018-01-28 21:10:21,192 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-28 21:10:21,192 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,192 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-28 21:10:21,192 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-28 21:10:21,193 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-28 21:10:21,193 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,193 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-28 21:10:21,193 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,193 INFO L395 ceAbstractionStarter]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~3.base)) (.cse1 (select |#length| main_~nondetString2~3.base))) (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc11.offset|) (= .cse0 main_~length1~3) (= main_~length1~3 (select |#length| |main_#t~malloc10.base|)) (<= (+ main_~nondetString1~3.offset 1) .cse0) (= 1 (select |#valid| main_~nondetString2~3.base)) (not (= |main_#t~malloc11.base| main_~nondetString1~3.base)) (= 0 (select (select |#memory_int| main_~nondetString2~3.base) (+ .cse1 (+ main_~nondetString2~3.offset (- 1))))) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= 1 (select |#valid| main_~nondetString1~3.base)) (= .cse1 main_~length2~3) (exists ((main_~nondetString1~3.offset Int)) (and (<= main_~nondetString1~3.offset 0) (= (select (select |#memory_int| main_~nondetString1~3.base) (+ main_~nondetString1~3.offset (select |#length| main_~nondetString1~3.base) (- 1))) 0) (<= 0 main_~nondetString1~3.offset))) (not (= main_~nondetString2~3.base main_~nondetString1~3.base)) (<= 1 main_~length2~3) (= 1 (select |#valid| |main_#t~malloc11.base|)) (= main_~length2~3 (select |#length| |main_#t~malloc11.base|)) (= 0 main_~nondetString1~3.offset) (= |main_#t~malloc10.offset| 0) (= 0 main_~nondetString2~3.offset) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0)))) [2018-01-28 21:10:21,193 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-28 21:10:21,194 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-28 21:10:21,195 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 548 562) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 548 562) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 548 562) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 548 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point L561''(line 561) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-28 21:10:21,196 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-28 21:10:21,197 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-28 21:10:21,208 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,209 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,216 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,217 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,219 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,219 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,219 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,219 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,220 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,220 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,220 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,220 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,247 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,248 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,248 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,248 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,248 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,249 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,249 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,249 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,250 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,250 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,250 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,251 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,251 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,251 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,251 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:10:21 BoogieIcfgContainer [2018-01-28 21:10:21,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:10:21,266 INFO L168 Benchmark]: Toolchain (without parser) took 68361.76 ms. Allocated memory was 301.5 MB in the beginning and 643.3 MB in the end (delta: 341.8 MB). Free memory was 261.5 MB in the beginning and 469.6 MB in the end (delta: -208.1 MB). Peak memory consumption was 294.3 MB. Max. memory is 5.3 GB. [2018-01-28 21:10:21,267 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:10:21,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.70 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-28 21:10:21,268 INFO L168 Benchmark]: Boogie Preprocessor took 32.04 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:10:21,268 INFO L168 Benchmark]: RCFGBuilder took 290.11 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 227.7 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:10:21,269 INFO L168 Benchmark]: TraceAbstraction took 67829.79 ms. Allocated memory was 301.5 MB in the beginning and 643.3 MB in the end (delta: 341.8 MB). Free memory was 227.7 MB in the beginning and 469.6 MB in the end (delta: -242.0 MB). Peak memory consumption was 260.4 MB. Max. memory is 5.3 GB. [2018-01-28 21:10:21,270 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.18 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.70 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.04 ms. Allocated memory is still 301.5 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.11 ms. Allocated memory is still 301.5 MB. Free memory was 248.3 MB in the beginning and 227.7 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67829.79 ms. Allocated memory was 301.5 MB in the beginning and 643.3 MB in the end (delta: 341.8 MB). Free memory was 227.7 MB in the beginning and 469.6 MB in the end (delta: -242.0 MB). Peak memory consumption was 260.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-28 21:10:21,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,291 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,301 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,302 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,302 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,302 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~3,QUANTIFIED] [2018-01-28 21:10:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:10:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString1~3.offset,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.base,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~3.offset,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~3,QUANTIFIED] [2018-01-28 21:10:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~3.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:10:21,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:10:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:10:21,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((((s1 + 1 <= unknown-#length-unknown[s1] && 1 == \valid[s1]) && 1 == \valid[s2]) && 2 <= s1) && (\exists main_~nondetString1~3.offset : int :: (main_~nondetString1~3.offset <= 0 && 0 <= main_~nondetString1~3.offset) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + main_~nondetString1~3.offset + -1])) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && s2 + 1 <= unknown-#length-unknown[s2]) && 2 <= s2) || !(0 == s2)) || !(unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0)) || !(\exists main_~nondetString1~3.offset : int :: (main_~nondetString1~3.offset <= 0 && 0 <= main_~nondetString1~3.offset) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + main_~nondetString1~3.offset + -1])) || !(1 == \valid[s2])) || !(\exists main_~nondetString2~3.base : int, main_~nondetString2~3.offset : int :: unknown-#memory_int-unknown[main_~nondetString2~3.base][unknown-#length-unknown[main_~nondetString2~3.base] + main_~nondetString2~3.offset + -1] == 0 && !(main_~nondetString2~3.base == s1))) || !(\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_1 : int :: ((main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s1] && s1 <= v_main_~nondetString1~3.offset_BEFORE_CALL_1) && unknown-#memory_int-unknown[s1][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length1~3)) || (((((((1 == \valid[s1] && (\exists main_~length1~3 : int, v_main_~nondetString1~3.offset_BEFORE_CALL_1 : int :: ((s1 <= v_main_~nondetString1~3.offset_BEFORE_CALL_1 && main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s1]) && 0 == unknown-#memory_int-unknown[s1][main_~length1~3 + v_main_~nondetString1~3.offset_BEFORE_CALL_1 + -1]) && 1 <= main_~length1~3)) && 1 == \valid[s2]) && 0 == s2) && 0 == s1) && (\exists main_~nondetString1~3.offset : int :: (main_~nondetString1~3.offset <= 0 && 0 <= main_~nondetString1~3.offset) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + main_~nondetString1~3.offset + -1])) && (\exists main_~length2~3 : int, v_main_~nondetString2~3.offset_BEFORE_CALL_1 : int :: ((s2 <= v_main_~nondetString2~3.offset_BEFORE_CALL_1 && unknown-#memory_int-unknown[s2][main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length2~3) && main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s2])) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0)) || !(\valid[s1] == 1)) || !(s1 == 0)) || (((((((((((s1 + 1 <= unknown-#length-unknown[s1] && 1 == \valid[s1]) && (s2 + 2 <= unknown-#length-unknown[s2] || s2 <= 1)) && 1 <= s2) && 1 == \valid[s2]) && unknown-#memory_int-unknown[s2][s2 + -1] == unknown-#memory_int-unknown[s1][0]) && !(unknown-#memory_int-unknown[s1][0] == 0)) && (\exists main_~nondetString1~3.offset : int :: (main_~nondetString1~3.offset <= 0 && 0 <= main_~nondetString1~3.offset) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + main_~nondetString1~3.offset + -1])) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && (\exists main_~nondetString2~3.base : int, main_~nondetString2~3.offset : int :: !(s1 == main_~nondetString2~3.base) && unknown-#memory_int-unknown[main_~nondetString2~3.base][unknown-#length-unknown[main_~nondetString2~3.base] + main_~nondetString2~3.offset + -1] == 0)) && s2 + 1 <= unknown-#length-unknown[s2]) && s1 == 1)) || !(\exists main_~length2~3 : int, v_main_~nondetString2~3.offset_BEFORE_CALL_2 : int :: ((s2 <= v_main_~nondetString2~3.offset_BEFORE_CALL_2 && 1 <= main_~length2~3) && main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s2]) && unknown-#memory_int-unknown[s2][main_~length2~3 + v_main_~nondetString2~3.offset_BEFORE_CALL_2 + -1] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 82 locations, 15 error locations. SAFE Result, 67.7s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 45.9s AutomataDifference, 0.0s DeadEndRemovalTime, 13.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1180 SDtfs, 2339 SDslu, 6556 SDs, 0 SdLazy, 4384 SolverSat, 235 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 738 GetRequests, 308 SyntacticMatches, 3 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4319 ImplicationChecksByTransitivity, 44.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 523 HoareAnnotationTreeSize, 7 FomulaSimplifications, 164 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1537 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1088 ConstructedInterpolants, 92 QuantifiedInterpolants, 578305 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1223 ConjunctsInSsa, 272 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 51/258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-10-21-317.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-10-21-317.csv Received shutdown request...