java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:52:48,076 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:52:48,078 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:52:48,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:52:48,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:52:48,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:52:48,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:52:48,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:52:48,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:52:48,100 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:52:48,101 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:52:48,101 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:52:48,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:52:48,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:52:48,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:52:48,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:52:48,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:52:48,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:52:48,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:52:48,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:52:48,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:52:48,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:52:48,116 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:52:48,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:52:48,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:52:48,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:52:48,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:52:48,120 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:52:48,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:52:48,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:52:48,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:52:48,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:52:48,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:52:48,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:52:48,132 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:52:48,132 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:52:48,132 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:52:48,132 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:52:48,133 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:52:48,133 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:52:48,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:52:48,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:52:48,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:52:48,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:52:48,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:52:48,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:52:48,134 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:52:48,134 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:52:48,134 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:52:48,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:52:48,135 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:52:48,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:52:48,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:52:48,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:52:48,135 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:52:48,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:52:48,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:52:48,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:52:48,136 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:52:48,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:52:48,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:52:48,136 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:52:48,137 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:52:48,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:52:48,137 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:52:48,137 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:52:48,138 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:52:48,138 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:52:48,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:52:48,181 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:52:48,185 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:52:48,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:52:48,186 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:52:48,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:52:48,346 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:52:48,350 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:52:48,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:52:48,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:52:48,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:52:48,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386958ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48, skipping insertion in model container [2018-01-24 16:52:48,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,375 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:52:48,414 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:52:48,532 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:52:48,548 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:52:48,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48 WrapperNode [2018-01-24 16:52:48,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:52:48,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:52:48,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:52:48,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:52:48,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... [2018-01-24 16:52:48,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:52:48,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:52:48,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:52:48,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:52:48,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:52:48,647 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:52:48,648 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:52:48,648 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-01-24 16:52:48,648 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:52:48,648 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:52:48,648 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:52:48,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:52:48,649 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:52:48,649 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:52:48,649 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:52:48,649 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-01-24 16:52:48,649 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:52:48,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:52:48,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:52:48,890 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:52:48,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:52:48 BoogieIcfgContainer [2018-01-24 16:52:48,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:52:48,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:52:48,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:52:48,893 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:52:48,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:52:48" (1/3) ... [2018-01-24 16:52:48,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb524a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:52:48, skipping insertion in model container [2018-01-24 16:52:48,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:48" (2/3) ... [2018-01-24 16:52:48,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb524a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:52:48, skipping insertion in model container [2018-01-24 16:52:48,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:52:48" (3/3) ... [2018-01-24 16:52:48,897 INFO L105 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:52:48,903 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:52:48,909 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 16:52:48,956 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:52:48,956 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:52:48,956 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:52:48,956 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:52:48,957 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:52:48,957 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:52:48,957 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:52:48,957 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:52:48,958 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:52:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-24 16:52:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:52:48,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:48,987 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:48,988 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-01-24 16:52:48,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:49,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:49,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,050 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:49,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:49,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:49,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:49,254 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:49,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:52:49,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:52:49,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:52:49,337 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-24 16:52:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:49,504 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-24 16:52:49,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:52:49,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:52:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:49,513 INFO L225 Difference]: With dead ends: 71 [2018-01-24 16:52:49,513 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:52:49,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:52:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 16:52:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:52:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 16:52:49,550 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-24 16:52:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:49,551 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 16:52:49,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:52:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 16:52:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:52:49,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:49,552 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:49,552 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-01-24 16:52:49,552 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:49,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:49,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,554 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:49,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:49,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:49,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:52:49,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:49,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:52:49,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:52:49,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:49,730 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-01-24 16:52:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:49,834 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 16:52:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:52:49,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 16:52:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:49,835 INFO L225 Difference]: With dead ends: 51 [2018-01-24 16:52:49,835 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:52:49,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:52:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:52:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:52:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:52:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 16:52:49,844 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-01-24 16:52:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:49,844 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 16:52:49,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:52:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 16:52:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:52:49,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:49,845 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:49,845 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-01-24 16:52:49,846 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:49,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:49,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:49,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:49,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:49,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:49,889 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:49,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:52:49,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:52:49,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:52:49,890 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-01-24 16:52:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:49,976 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 16:52:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:52:49,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:52:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:49,977 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:52:49,978 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:52:49,978 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:52:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 16:52:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:52:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 16:52:49,985 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-24 16:52:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:49,986 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 16:52:49,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:52:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 16:52:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:52:49,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:49,987 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:49,987 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-01-24 16:52:49,988 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:49,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:49,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:49,989 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:50,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:50,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:50,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:52:50,087 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:50,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:52:50,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:52:50,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:50,087 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-24 16:52:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:50,122 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 16:52:50,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:52:50,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:52:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:50,123 INFO L225 Difference]: With dead ends: 49 [2018-01-24 16:52:50,123 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 16:52:50,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 16:52:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 16:52:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 16:52:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 16:52:50,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-01-24 16:52:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:50,128 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 16:52:50,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:52:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 16:52:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:52:50,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:50,129 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:50,129 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:50,129 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-01-24 16:52:50,129 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:50,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:50,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:50,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:50,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:50,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:52:50,174 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:50,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:52:50,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:52:50,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:50,175 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-24 16:52:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:50,240 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-24 16:52:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:52:50,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:52:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:50,242 INFO L225 Difference]: With dead ends: 48 [2018-01-24 16:52:50,242 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 16:52:50,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 16:52:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 16:52:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 16:52:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-24 16:52:50,248 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-01-24 16:52:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:50,249 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-24 16:52:50,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:52:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-24 16:52:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:52:50,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:50,250 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:50,250 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-01-24 16:52:50,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:50,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:50,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,252 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:50,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:50,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:50,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:52:50,359 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:50,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:52:50,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:52:50,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:52:50,361 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-01-24 16:52:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:50,507 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 16:52:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:52:50,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 16:52:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:50,510 INFO L225 Difference]: With dead ends: 69 [2018-01-24 16:52:50,511 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 16:52:50,511 INFO L525 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-24 16:52:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 16:52:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-01-24 16:52:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 16:52:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-01-24 16:52:50,517 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-01-24 16:52:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:50,517 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-01-24 16:52:50,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:52:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-01-24 16:52:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:52:50,518 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:50,518 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:50,518 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-01-24 16:52:50,518 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:50,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:50,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:50,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:50,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:50,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:52:50,561 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:50,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:52:50,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:52:50,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:50,562 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-01-24 16:52:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:50,657 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-01-24 16:52:50,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:52:50,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 16:52:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:50,658 INFO L225 Difference]: With dead ends: 57 [2018-01-24 16:52:50,658 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 16:52:50,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 16:52:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 16:52:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 16:52:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-24 16:52:50,665 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-01-24 16:52:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:50,665 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-24 16:52:50,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:52:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-24 16:52:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:52:50,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:50,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:50,667 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:50,667 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-01-24 16:52:50,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:50,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:50,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:50,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:50,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:50,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:52:50,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:50,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:52:50,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:52:50,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:52:50,772 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-01-24 16:52:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:50,913 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-01-24 16:52:50,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:52:50,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 16:52:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:50,914 INFO L225 Difference]: With dead ends: 73 [2018-01-24 16:52:50,915 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 16:52:50,915 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:52:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 16:52:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-01-24 16:52:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 16:52:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-01-24 16:52:50,923 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-01-24 16:52:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:50,924 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-01-24 16:52:50,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:52:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-01-24 16:52:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:52:50,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:50,925 INFO L322 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] [2018-01-24 16:52:50,925 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-01-24 16:52:50,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:50,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:50,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:50,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:50,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:50,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:50,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:50,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:52:50,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:52:50,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:52:50,968 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-01-24 16:52:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:50,980 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-01-24 16:52:50,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:52:50,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-24 16:52:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:50,983 INFO L225 Difference]: With dead ends: 107 [2018-01-24 16:52:50,983 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 16:52:50,984 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:52:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 16:52:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-01-24 16:52:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 16:52:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-01-24 16:52:50,992 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-01-24 16:52:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:50,992 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-01-24 16:52:50,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:52:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-01-24 16:52:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:52:50,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:50,994 INFO L322 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] [2018-01-24 16:52:50,994 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:50,994 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-01-24 16:52:50,994 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:50,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:50,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,996 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:51,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:51,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 16:52:51,354 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:51,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:52:51,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:52:51,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:52:51,354 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-01-24 16:52:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:51,767 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-01-24 16:52:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 16:52:51,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-24 16:52:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:51,769 INFO L225 Difference]: With dead ends: 140 [2018-01-24 16:52:51,769 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 16:52:51,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-01-24 16:52:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 16:52:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-24 16:52:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 16:52:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-01-24 16:52:51,779 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-01-24 16:52:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:51,780 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-01-24 16:52:51,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:52:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-01-24 16:52:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:52:51,781 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:51,782 INFO L322 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] [2018-01-24 16:52:51,782 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:52:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-01-24 16:52:51,782 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:51,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:51,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,783 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:52,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:52,154 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:52:52,155 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 16:52:52,157 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [26], [27], [30], [35], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 16:52:52,201 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:52:52,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:52:52,590 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:52:52,591 INFO L268 AbstractInterpreter]: Visited 28 different actions 56 times. Merged at 12 different actions 27 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-24 16:52:52,613 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:52:52,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:52,613 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:52:52,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:52,627 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:52:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:52,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:52,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:52,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:52:52,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:52:52,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:52:52,827 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-24 16:52:52,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:52:52,864 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-24 16:52:52,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:52:52,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:52:52,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 16:52:52,966 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-24 16:52:52,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:52:52,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:52,980 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-24 16:52:52,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 16:52:53,980 WARN L143 SmtUtils]: Spent 682ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-24 16:52:54,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-01-24 16:52:54,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-01-24 16:52:54,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 16:52:54,298 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 31 treesize of output 23 [2018-01-24 16:52:54,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,301 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 35 treesize of output 27 [2018-01-24 16:52:54,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,304 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 34 treesize of output 26 [2018-01-24 16:52:54,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-01-24 16:52:54,361 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,457 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 37 treesize of output 29 [2018-01-24 16:52:54,457 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,527 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 34 treesize of output 26 [2018-01-24 16:52:54,528 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,586 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 29 treesize of output 27 [2018-01-24 16:52:54,587 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:54,725 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 26 treesize of output 24 [2018-01-24 16:52:54,726 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:54,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-24 16:52:54,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:52:54,832 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-24 16:52:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:54,881 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:55,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 16:52:55,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,370 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 26 treesize of output 28 [2018-01-24 16:52:55,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-24 16:52:55,400 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,411 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 16:52:55,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,427 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-01-24 16:52:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:55,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:55,488 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:52:55,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:55,492 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:52:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:55,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:55,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:55,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:55,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:52:55,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:52:55,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:52:55,610 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-24 16:52:55,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,616 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-24 16:52:55,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 16:52:55,686 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-24 16:52:55,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:52:55,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:52:55,738 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-24 16:52:55,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:52:55,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:52:55,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 16:52:55,906 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 31 treesize of output 29 [2018-01-24 16:52:55,907 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-24 16:52:55,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:55,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-24 16:52:55,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:52:55,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:55,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:52:55,927 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 16:52:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:56,117 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:56,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:52:56,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:52:56,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:56,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:56,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:56,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 16:52:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:56,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:52:56,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13, 13, 11] total 61 [2018-01-24 16:52:56,663 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:52:56,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 16:52:56,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 16:52:56,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3511, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 16:52:56,665 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 30 states. [2018-01-24 16:52:59,567 WARN L146 SmtUtils]: Spent 2145ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-01-24 16:53:02,192 WARN L146 SmtUtils]: Spent 1541ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-01-24 16:53:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:53:02,440 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2018-01-24 16:53:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 16:53:02,440 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-01-24 16:53:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:53:02,441 INFO L225 Difference]: With dead ends: 110 [2018-01-24 16:53:02,441 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 16:53:02,443 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=644, Invalid=6162, Unknown=0, NotChecked=0, Total=6806 [2018-01-24 16:53:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 16:53:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-24 16:53:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 16:53:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-01-24 16:53:02,451 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 29 [2018-01-24 16:53:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:53:02,452 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-01-24 16:53:02,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 16:53:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-01-24 16:53:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:53:02,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:53:02,453 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:53:02,453 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:53:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-01-24 16:53:02,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:53:02,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:02,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:02,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:02,455 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:53:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:02,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:53:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:02,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:53:02,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:53:02,559 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:53:02,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:53:02,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:53:02,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:53:02,560 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2018-01-24 16:53:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:53:02,669 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-01-24 16:53:02,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:53:02,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 16:53:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:53:02,702 INFO L225 Difference]: With dead ends: 89 [2018-01-24 16:53:02,702 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 16:53:02,702 INFO L525 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-24 16:53:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 16:53:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-24 16:53:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 16:53:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-01-24 16:53:02,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 31 [2018-01-24 16:53:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:53:02,712 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-01-24 16:53:02,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:53:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-01-24 16:53:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:53:02,713 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:53:02,713 INFO L322 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] [2018-01-24 16:53:02,713 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:53:02,713 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-01-24 16:53:02,714 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:53:02,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:02,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:02,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:02,715 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:53:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:02,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:53:02,934 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-24 16:53:02,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:02,934 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:53:02,935 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 16:53:02,935 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [37], [39], [54], [57], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 16:53:02,937 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:53:02,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:53:03,128 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:53:03,128 INFO L268 AbstractInterpreter]: Visited 28 different actions 55 times. Merged at 12 different actions 27 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-01-24 16:53:03,132 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:53:03,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:03,132 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:53:03,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:03,137 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:53:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:03,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:53:03,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:53:03,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:53:03,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:53:03,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:53:03,229 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-24 16:53:03,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:53:03,271 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 11 treesize of output 8 [2018-01-24 16:53:03,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:53:03,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-24 16:53:03,294 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 22 treesize of output 23 [2018-01-24 16:53:03,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:53:03,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,305 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-24 16:53:03,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-24 16:53:03,377 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 25 treesize of output 23 [2018-01-24 16:53:03,380 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-24 16:53:03,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:53:03,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,396 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-01-24 16:53:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 16:53:03,426 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:53:03,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:53:03,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:53:03,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:03,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-01-24 16:53:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 16:53:03,569 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:53:03,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 9] imperfect sequences [11] total 27 [2018-01-24 16:53:03,570 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:53:03,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:53:03,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:53:03,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-01-24 16:53:03,570 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 13 states. [2018-01-24 16:53:06,751 WARN L143 SmtUtils]: Spent 3048ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-24 16:53:10,349 WARN L143 SmtUtils]: Spent 3582ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 16:53:14,372 WARN L143 SmtUtils]: Spent 4008ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-24 16:53:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:53:14,428 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 16:53:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:53:14,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-01-24 16:53:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:53:14,429 INFO L225 Difference]: With dead ends: 75 [2018-01-24 16:53:14,429 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 16:53:14,430 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 16:53:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 16:53:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 16:53:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 16:53:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 16:53:14,435 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2018-01-24 16:53:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:53:14,435 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 16:53:14,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:53:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 16:53:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:53:14,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:53:14,437 INFO L322 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] [2018-01-24 16:53:14,437 INFO L371 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:53:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1784966119, now seen corresponding path program 1 times [2018-01-24 16:53:14,437 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:53:14,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:14,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:14,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:14,438 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:53:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:14,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:53:14,712 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-24 16:53:14,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:14,713 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:53:14,713 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 16:53:14,713 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [35], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 16:53:14,721 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:53:14,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:53:14,914 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:53:14,915 INFO L268 AbstractInterpreter]: Visited 28 different actions 55 times. Merged at 12 different actions 27 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 16:53:14,935 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:53:14,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:14,935 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:53:14,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:14,946 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:53:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:14,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:53:14,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:53:14,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:53:14,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:14,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:14,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:53:14,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:53:15,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 16:53:15,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:53:15,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:53:15,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:15,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:15,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 16:53:15,199 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-24 16:53:15,199 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:53:15,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:53:15,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:53:15,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:53:15,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 16:53:15,447 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-24 16:53:15,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:15,466 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:53:15,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:15,469 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:53:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:15,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:53:15,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:53:15,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:53:15,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:53:15,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:53:15,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:53:15,787 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 34 treesize of output 34 [2018-01-24 16:53:15,794 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 30 treesize of output 31 [2018-01-24 16:53:15,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:53:15,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-01-24 16:53:15,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-01-24 16:53:15,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:15,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-01-24 16:53:15,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-24 16:53:15,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 16:53:15,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:53:15,916 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:42, output treesize:62 [2018-01-24 16:53:16,027 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-24 16:53:16,028 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:53:16,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:53:16,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:53:16,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:16,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:16,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:16,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:53:16,365 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-24 16:53:16,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:53:16,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 14, 15] total 45 [2018-01-24 16:53:16,368 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:53:16,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 16:53:16,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 16:53:16,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 16:53:16,369 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 18 states. [2018-01-24 16:53:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:53:16,901 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-01-24 16:53:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:53:16,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-01-24 16:53:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:53:16,902 INFO L225 Difference]: With dead ends: 59 [2018-01-24 16:53:16,902 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 16:53:16,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 16:53:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 16:53:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-01-24 16:53:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:53:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 16:53:16,907 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-01-24 16:53:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:53:16,907 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 16:53:16,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 16:53:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 16:53:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 16:53:16,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:53:16,908 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:53:16,908 INFO L371 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:53:16,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1498931688, now seen corresponding path program 2 times [2018-01-24 16:53:16,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:53:16,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:16,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:16,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:16,909 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:53:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:16,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:53:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:17,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:17,340 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:53:17,340 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:53:17,340 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:53:17,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:17,340 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 16:53:17,345 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:53:17,345 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:53:17,356 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:53:17,364 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:53:17,366 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:53:17,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:53:17,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:53:17,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:17,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:17,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:53:17,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:53:17,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:53:17,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:17,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:17,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:17,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 16:53:17,673 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 35 treesize of output 35 [2018-01-24 16:53:17,679 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 31 treesize of output 29 [2018-01-24 16:53:17,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:53:17,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 35 [2018-01-24 16:53:17,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-24 16:53:17,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-01-24 16:53:17,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:17,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-01-24 16:53:17,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:17,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 16:53:17,801 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-24 16:53:17,801 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:53, output treesize:98 [2018-01-24 16:53:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:17,856 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:53:18,454 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 57 treesize of output 59 [2018-01-24 16:53:18,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 16:53:18,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,576 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 53 treesize of output 47 [2018-01-24 16:53:18,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 16:53:18,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:53:18,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,693 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 55 treesize of output 49 [2018-01-24 16:53:18,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-24 16:53:18,720 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:53:18,731 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,745 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 59 treesize of output 61 [2018-01-24 16:53:18,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-01-24 16:53:18,813 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-01-24 16:53:18,843 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-24 16:53:18,872 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,887 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:18,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:18,929 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:149, output treesize:98 [2018-01-24 16:53:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:19,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:19,189 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:53:19,193 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:53:19,193 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:53:19,224 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:53:19,285 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:53:19,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:53:19,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:53:19,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:53:19,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:19,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:19,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:53:19,402 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-24 16:53:19,405 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-24 16:53:19,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:19,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:19,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:19,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 16:53:19,732 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 34 treesize of output 34 [2018-01-24 16:53:19,735 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 30 treesize of output 22 [2018-01-24 16:53:19,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:19,745 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 22 treesize of output 17 [2018-01-24 16:53:19,746 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:19,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-01-24 16:53:19,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-24 16:53:19,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:53:19,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:53:19,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:76 [2018-01-24 16:53:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:19,870 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:53:20,362 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 26 treesize of output 28 [2018-01-24 16:53:20,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 16:53:20,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:20,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:20,419 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-24 16:53:20,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2018-01-24 16:53:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:20,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:53:20,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14, 15, 15] total 59 [2018-01-24 16:53:20,550 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:53:20,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 16:53:20,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 16:53:20,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=3187, Unknown=0, NotChecked=0, Total=3540 [2018-01-24 16:53:20,551 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 27 states. [2018-01-24 16:53:21,628 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 68 DAG size of output 55 [2018-01-24 16:53:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:53:22,947 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-01-24 16:53:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 16:53:22,947 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-24 16:53:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:53:22,948 INFO L225 Difference]: With dead ends: 74 [2018-01-24 16:53:22,948 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 16:53:22,950 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1141, Invalid=6869, Unknown=0, NotChecked=0, Total=8010 [2018-01-24 16:53:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 16:53:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-01-24 16:53:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:53:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 16:53:22,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 43 [2018-01-24 16:53:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:53:22,955 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 16:53:22,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 16:53:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 16:53:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 16:53:22,956 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:53:22,956 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-01-24 16:53:22,956 INFO L371 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:53:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash 276075674, now seen corresponding path program 1 times [2018-01-24 16:53:22,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:53:22,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:22,957 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:53:22,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:53:22,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:53:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:22,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:53:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:23,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:23,321 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:53:23,321 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-24 16:53:23,322 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [35], [37], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 16:53:23,323 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:53:23,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:53:23,489 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:53:23,489 INFO L268 AbstractInterpreter]: Visited 29 different actions 56 times. Merged at 13 different actions 25 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-24 16:53:23,491 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:53:23,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:23,491 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:53:23,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:23,504 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:53:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:23,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:53:23,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:53:23,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:23,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:23,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:53:23,577 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-24 16:53:23,580 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-24 16:53:23,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:23,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:23,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:23,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 16:53:23,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:53:23,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:53:23,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:53:23,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:23,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:23,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 16:53:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:23,761 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:53:24,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:53:24,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:53:24,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:24,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 16:53:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:24,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:53:24,147 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:53:24,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:53:24,152 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:53:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:53:24,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:53:24,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:53:24,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:53:24,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:53:24,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:53:24,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:53:24,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 16:53:24,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:53:24,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:53:24,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:24,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:24,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-01-24 16:53:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:24,353 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:53:24,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:53:24,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:53:24,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:53:24,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:53:24,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 16:53:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:53:24,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:53:24,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 11, 11] total 39 [2018-01-24 16:53:24,672 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:53:24,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 16:53:24,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 16:53:24,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1413, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 16:53:24,673 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 20 states. [2018-01-24 16:53:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:53:25,227 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-01-24 16:53:25,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:53:25,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-01-24 16:53:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:53:25,228 INFO L225 Difference]: With dead ends: 64 [2018-01-24 16:53:25,228 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:53:25,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 16:53:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:53:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:53:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:53:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:53:25,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-24 16:53:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:53:25,230 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:53:25,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 16:53:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:53:25,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:53:25,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:53:25,992 WARN L146 SmtUtils]: Spent 650ms on a formula simplification. DAG size of input: 169 DAG size of output 125 [2018-01-24 16:53:26,259 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 98 DAG size of output 71 [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point subseqErr5RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point L544'''''''''(lines 544 549) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point subseqErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 16:53:26,262 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point subseqErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L404 ceAbstractionStarter]: At program point subseqENTRY(lines 540 552) the Hoare annotation is: true [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point subseqErr9RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 547) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point subseqErr8RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point subseqFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point subseqErr4RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L397 ceAbstractionStarter]: At program point L544''''''''(lines 544 549) the Hoare annotation is: (let ((.cse0 (not (= 1 (select |#valid| |subseq_#in~s.base|)))) (.cse4 (select |#length| subseq_~pt~2.base)) (.cse6 (not (= 0 |subseq_#in~s.offset|))) (.cse7 (not (exists ((main_~length2~5 Int) (main_~nondetString2~5.base Int) (main_~nondetString2~5.offset Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~5.base) (+ main_~length2~5 main_~nondetString2~5.offset (- 1)))) (not (= |subseq_#in~s.base| main_~nondetString2~5.base)))))) (.cse8 (not (= 0 |subseq_#in~t.offset|))) (.cse2 (= 1 (select |#valid| subseq_~pt~2.base))) (.cse3 (= subseq_~ps~2.offset 0)) (.cse5 (= 1 (select |#valid| subseq_~ps~2.base))) (.cse1 (not (= 1 (select |#valid| |subseq_#in~t.base|)))) (.cse9 (not (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (<= |subseq_#in~s.offset| v_main_~nondetString1~5.offset_BEFORE_CALL_2) (<= 1 main_~length1~5) (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (select |#length| |subseq_#in~s.base|)) (= 0 (select (select |#memory_int| |subseq_#in~s.base|) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1))))))))) (and (or .cse0 .cse1 (and .cse2 (= subseq_~pt~2.offset 0) (= 0 (select (select |#memory_int| subseq_~ps~2.base) subseq_~ps~2.offset)) .cse3 (<= 1 .cse4) (<= 1 (select |#length| subseq_~ps~2.base)) .cse5) .cse6 .cse7 (< (select |#length| |subseq_#in~t.base|) 1) .cse8 (not (= 0 (select (select |#memory_int| |subseq_#in~s.base|) |subseq_#in~s.offset|))) .cse9) (let ((.cse10 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_2 Int)) (and (= 0 (select (select |#memory_int| subseq_~ps~2.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2 (- 1)))) (<= subseq_~ps~2.offset v_main_~nondetString1~5.offset_BEFORE_CALL_2) (<= 1 main_~length1~5) (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_2) (select |#length| subseq_~ps~2.base)))))) (or .cse0 (and (and (<= (+ subseq_~pt~2.offset 1) .cse4) (<= 1 subseq_~pt~2.offset) (and .cse2 (<= 1 subseq_~ps~2.offset) .cse10 .cse5)) (= (select (select |#memory_int| subseq_~pt~2.base) (+ .cse4 (- 1))) 0)) .cse6 .cse7 .cse8 (not (exists ((v_main_~nondetString2~5.offset_BEFORE_CALL_6 Int)) (and (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 0) (= (select (select |#memory_int| |subseq_#in~t.base|) (+ (select |#length| |subseq_#in~t.base|) v_main_~nondetString2~5.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 |subseq_#in~t.offset|) (<= 0 v_main_~nondetString2~5.offset_BEFORE_CALL_6)))) (and .cse2 (exists ((v_main_~nondetString2~5.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| subseq_~pt~2.base) (+ (select |#length| subseq_~pt~2.base) v_main_~nondetString2~5.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 0) (<= v_main_~nondetString2~5.offset_BEFORE_CALL_6 subseq_~pt~2.offset) (<= 0 v_main_~nondetString2~5.offset_BEFORE_CALL_6))) (exists ((main_~length2~5 Int) (v_main_~nondetString2~5.offset_BEFORE_CALL_4 Int)) (and (= 0 (select (select |#memory_int| subseq_~pt~2.base) (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4 (- 1)))) (<= (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4) (select |#length| subseq_~pt~2.base)) (<= 1 main_~length2~5) (<= subseq_~pt~2.offset v_main_~nondetString2~5.offset_BEFORE_CALL_4))) .cse10 .cse3 .cse5) .cse1 (not (exists ((main_~length2~5 Int) (v_main_~nondetString2~5.offset_BEFORE_CALL_4 Int)) (and (= 0 (select (select |#memory_int| |subseq_#in~t.base|) (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4 (- 1)))) (<= (+ main_~length2~5 v_main_~nondetString2~5.offset_BEFORE_CALL_4) (select |#length| |subseq_#in~t.base|)) (<= |subseq_#in~t.offset| v_main_~nondetString2~5.offset_BEFORE_CALL_4) (<= 1 main_~length2~5)))) .cse9)))) [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-24 16:53:26,263 INFO L401 ceAbstractionStarter]: For program point subseqErr7RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point subseqEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point subseqErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point subseqErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point subseqErr6RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 567) the Hoare annotation is: true [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 567) the Hoare annotation is: true [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,264 INFO L401 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L397 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse18 (select |#length| main_~nondetString2~5.base))) (let ((.cse0 (= 1 (select |#valid| main_~nondetString2~5.base))) (.cse1 (= main_~length1~5 (select |#length| main_~nondetString1~5.base))) (.cse2 (= 0 |main_#t~malloc11.offset|)) (.cse3 (= main_~nondetString2~5.offset 0)) (.cse4 (<= 1 main_~length2~5)) (.cse5 (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|))) (.cse6 (= 1 (select |#valid| |main_#t~malloc11.base|))) (.cse7 (= 1 (select |#valid| |main_#t~malloc10.base|))) (.cse8 (= main_~nondetString1~5.offset 0)) (.cse9 (= 0 |main_#t~malloc10.offset|)) (.cse10 (not (= main_~nondetString1~5.base main_~nondetString2~5.base))) (.cse11 (= (select |#valid| main_~nondetString1~5.base) 1)) (.cse12 (exists ((main_~length1~5 Int)) (and (<= (+ main_~length1~5 main_~nondetString1~5.offset) (select |#length| main_~nondetString1~5.base)) (= 0 (select (select |#memory_int| main_~nondetString1~5.base) (+ main_~length1~5 main_~nondetString1~5.offset (- 1)))) (<= 1 main_~length1~5)))) (.cse13 (= main_~length2~5 .cse18)) (.cse14 (= main_~length1~5 (select |#length| |main_#t~malloc10.base|))) (.cse15 (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))) (.cse16 (= main_~length2~5 (select |#length| |main_#t~malloc11.base|))) (.cse17 (not (= main_~nondetString1~5.base |main_#t~malloc11.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((main_~length2~5 Int) (main_~nondetString2~5.base Int) (main_~nondetString2~5.offset Int)) (and (not (= main_~nondetString2~5.base main_~nondetString1~5.base)) (= (select (select |#memory_int| main_~nondetString2~5.base) (+ main_~length2~5 main_~nondetString2~5.offset (- 1))) 0))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 1 main_~length1~5) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 (select (select |#memory_int| main_~nondetString2~5.base) (+ .cse18 (- 1)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-24 16:53:26,265 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 567) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 553 567) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 567) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point L563'''(line 563) no Hoare annotation was computed. [2018-01-24 16:53:26,266 INFO L401 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-24 16:53:26,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,278 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,279 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,280 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,281 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,287 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,288 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,289 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,290 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,294 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,295 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,296 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,297 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,298 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,312 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,313 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,316 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,318 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,326 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:53:26 BoogieIcfgContainer [2018-01-24 16:53:26,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:53:26,330 INFO L168 Benchmark]: Toolchain (without parser) took 37983.43 ms. Allocated memory was 305.7 MB in the beginning and 655.4 MB in the end (delta: 349.7 MB). Free memory was 265.6 MB in the beginning and 553.0 MB in the end (delta: -287.4 MB). Peak memory consumption was 307.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:53:26,331 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:53:26,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.35 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:53:26,332 INFO L168 Benchmark]: Boogie Preprocessor took 38.74 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:53:26,332 INFO L168 Benchmark]: RCFGBuilder took 296.33 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 233.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:53:26,333 INFO L168 Benchmark]: TraceAbstraction took 37437.79 ms. Allocated memory was 305.7 MB in the beginning and 655.4 MB in the end (delta: 349.7 MB). Free memory was 233.5 MB in the beginning and 553.0 MB in the end (delta: -319.5 MB). Peak memory consumption was 275.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:53:26,335 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.35 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.74 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 296.33 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 233.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 37437.79 ms. Allocated memory was 305.7 MB in the beginning and 655.4 MB in the end (delta: 349.7 MB). Free memory was 233.5 MB in the beginning and 553.0 MB in the end (delta: -319.5 MB). Peak memory consumption was 275.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 324 LocStat_NO_SUPPORTING_DISEQUALITIES : 57 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.730348 RENAME_VARIABLES(MILLISECONDS) : 0.428783 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.784269 PROJECTAWAY(MILLISECONDS) : 0.063703 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001844 DISJOIN(MILLISECONDS) : 0.656938 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.466341 ADD_EQUALITY(MILLISECONDS) : 0.034252 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016038 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 177 #UNFREEZE : 0 #CONJOIN : 164 #PROJECTAWAY : 131 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 322 LocStat_NO_SUPPORTING_DISEQUALITIES : 60 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.867708 RENAME_VARIABLES(MILLISECONDS) : 0.164854 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.345431 PROJECTAWAY(MILLISECONDS) : 0.047011 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001068 DISJOIN(MILLISECONDS) : 0.354331 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.194765 ADD_EQUALITY(MILLISECONDS) : 0.020682 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011858 #CONJOIN_DISJUNCTIVE : 98 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 159 #PROJECTAWAY : 126 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 328 LocStat_NO_SUPPORTING_DISEQUALITIES : 57 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.800252 RENAME_VARIABLES(MILLISECONDS) : 0.248367 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.352140 PROJECTAWAY(MILLISECONDS) : 0.069018 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001097 DISJOIN(MILLISECONDS) : 0.370223 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.274948 ADD_EQUALITY(MILLISECONDS) : 0.016220 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009188 #CONJOIN_DISJUNCTIVE : 98 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 160 #PROJECTAWAY : 127 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 157 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 330 LocStat_NO_SUPPORTING_DISEQUALITIES : 57 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.361502 RENAME_VARIABLES(MILLISECONDS) : 0.234401 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.333902 PROJECTAWAY(MILLISECONDS) : 0.238070 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000937 DISJOIN(MILLISECONDS) : 0.381526 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.260799 ADD_EQUALITY(MILLISECONDS) : 0.015086 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013300 #CONJOIN_DISJUNCTIVE : 99 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 159 #PROJECTAWAY : 127 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 159 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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 * 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: 553]: 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: 544]: Loop Invariant [2018-01-24 16:53:26,352 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,352 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,352 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,352 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,354 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,355 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,356 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,359 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,361 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 16:53:26,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 16:53:26,373 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,374 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,374 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,374 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,374 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,374 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 16:53:26,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,375 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,376 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,377 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~5.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 16:53:26,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 16:53:26,378 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 16:53:26,379 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 16:53:26,379 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,380 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,381 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,382 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,383 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 16:53:26,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 16:53:26,384 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((!(1 == \valid[s]) || !(1 == \valid[t])) || ((((((1 == \valid[pt] && pt == 0) && 0 == unknown-#memory_int-unknown[ps][ps]) && ps == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[ps])) || !(0 == s)) || !(\exists main_~length2~5 : int, main_~nondetString2~5.base : int, main_~nondetString2~5.offset : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~5.base][main_~length2~5 + main_~nondetString2~5.offset + -1] && !(s == main_~nondetString2~5.base))) || unknown-#length-unknown[t] < 1) || !(0 == t)) || !(0 == unknown-#memory_int-unknown[s][s])) || !(\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~5.offset_BEFORE_CALL_2 && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[s][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1])) && (((((((((!(1 == \valid[s]) || (((pt + 1 <= unknown-#length-unknown[pt] && 1 <= pt) && ((1 == \valid[pt] && 1 <= ps) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[ps][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1] && ps <= v_main_~nondetString1~5.offset_BEFORE_CALL_2) && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[ps])) && 1 == \valid[ps]) && unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] == 0)) || !(0 == s)) || !(\exists main_~length2~5 : int, main_~nondetString2~5.base : int, main_~nondetString2~5.offset : int :: 0 == unknown-#memory_int-unknown[main_~nondetString2~5.base][main_~length2~5 + main_~nondetString2~5.offset + -1] && !(s == main_~nondetString2~5.base))) || !(0 == t)) || !(\exists v_main_~nondetString2~5.offset_BEFORE_CALL_6 : int :: ((v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= 0 && unknown-#memory_int-unknown[t][unknown-#length-unknown[t] + v_main_~nondetString2~5.offset_BEFORE_CALL_6 + -1] == 0) && v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= t) && 0 <= v_main_~nondetString2~5.offset_BEFORE_CALL_6)) || (((((1 == \valid[pt] && (\exists v_main_~nondetString2~5.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + v_main_~nondetString2~5.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= 0) && v_main_~nondetString2~5.offset_BEFORE_CALL_6 <= pt) && 0 <= v_main_~nondetString2~5.offset_BEFORE_CALL_6)) && (\exists main_~length2~5 : int, v_main_~nondetString2~5.offset_BEFORE_CALL_4 : int :: ((0 == unknown-#memory_int-unknown[pt][main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 + -1] && main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 <= unknown-#length-unknown[pt]) && 1 <= main_~length2~5) && pt <= v_main_~nondetString2~5.offset_BEFORE_CALL_4)) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((0 == unknown-#memory_int-unknown[ps][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1] && ps <= v_main_~nondetString1~5.offset_BEFORE_CALL_2) && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[ps])) && ps == 0) && 1 == \valid[ps])) || !(1 == \valid[t])) || !(\exists main_~length2~5 : int, v_main_~nondetString2~5.offset_BEFORE_CALL_4 : int :: ((0 == unknown-#memory_int-unknown[t][main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 + -1] && main_~length2~5 + v_main_~nondetString2~5.offset_BEFORE_CALL_4 <= unknown-#length-unknown[t]) && t <= v_main_~nondetString2~5.offset_BEFORE_CALL_4) && 1 <= main_~length2~5)) || !(\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_2 : int :: ((s <= v_main_~nondetString1~5.offset_BEFORE_CALL_2 && 1 <= main_~length1~5) && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 <= unknown-#length-unknown[s]) && 0 == unknown-#memory_int-unknown[s][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_2 + -1])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. SAFE Result, 37.3s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 577 SDtfs, 1123 SDslu, 2233 SDs, 0 SdLazy, 2642 SolverSat, 312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 877 GetRequests, 478 SyntacticMatches, 21 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 5292 ImplicationChecksByTransitivity, 27.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 65 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 15 NumberOfFragments, 614 HoareAnnotationTreeSize, 9 FomulaSimplifications, 43 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2460 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1016 ConstructedInterpolants, 120 QuantifiedInterpolants, 502836 SizeOfPredicates, 146 NumberOfNonLiveVariables, 1423 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 34 InterpolantComputations, 13 PerfectInterpolantSequences, 37/264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-53-26-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-53-26-391.csv Received shutdown request...