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.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 15:23:33,947 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:23:33,948 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:23:33,960 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:23:33,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:23:33,961 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:23:33,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:23:33,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:23:33,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:23:33,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:23:33,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:23:33,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:23:33,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:23:33,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:23:33,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:23:33,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:23:33,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:23:33,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:23:33,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:23:33,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:23:33,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:23:33,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:23:33,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:23:33,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:23:33,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:23:33,984 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:23:33,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:23:33,985 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:23:33,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:23:33,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:23:33,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:23:33,986 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.epf [2018-01-24 15:23:33,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:23:33,996 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:23:33,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:23:33,997 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:23:33,997 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:23:33,997 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:23:33,998 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:23:33,998 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:23:33,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:23:33,999 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:23:33,999 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:23:33,999 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:23:33,999 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:23:34,000 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:23:34,000 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:23:34,000 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:23:34,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:23:34,000 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:23:34,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:23:34,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:23:34,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:23:34,001 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:23:34,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:23:34,002 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:23:34,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:23:34,002 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:23:34,002 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:23:34,002 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:23:34,003 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:23:34,003 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:23:34,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:23:34,003 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:23:34,003 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:23:34,004 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:23:34,005 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:23:34,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:23:34,053 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:23:34,057 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:23:34,059 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:23:34,059 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:23:34,060 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 15:23:34,235 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:23:34,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:23:34,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:23:34,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:23:34,246 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:23:34,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647aa831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34, skipping insertion in model container [2018-01-24 15:23:34,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,270 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:23:34,310 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:23:34,427 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:23:34,446 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:23:34,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34 WrapperNode [2018-01-24 15:23:34,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:23:34,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:23:34,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:23:34,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:23:34,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (1/1) ... [2018-01-24 15:23:34,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:23:34,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:23:34,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:23:34,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:23:34,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (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 15:23:34,537 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:23:34,537 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:23:34,558 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-01-24 15:23:34,558 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:23:34,558 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:23:34,558 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:23:34,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:23:34,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:23:34,558 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:23:34,558 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:23:34,559 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-01-24 15:23:34,559 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:23:34,559 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:23:34,559 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:23:34,756 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:23:34,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:23:34 BoogieIcfgContainer [2018-01-24 15:23:34,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:23:34,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:23:34,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:23:34,760 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:23:34,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:23:34" (1/3) ... [2018-01-24 15:23:34,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3f9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:23:34, skipping insertion in model container [2018-01-24 15:23:34,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:34" (2/3) ... [2018-01-24 15:23:34,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f3f9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:23:34, skipping insertion in model container [2018-01-24 15:23:34,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:23:34" (3/3) ... [2018-01-24 15:23:34,763 INFO L105 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:23:34,769 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:23:34,775 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 15:23:34,824 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:23:34,824 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:23:34,824 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:23:34,824 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:23:34,825 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:23:34,825 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:23:34,825 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:23:34,825 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:23:34,826 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:23:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-24 15:23:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:23:34,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:34,856 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:34,856 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:34,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-01-24 15:23:34,864 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:34,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:34,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:34,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:34,918 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:34,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:35,115 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 15:23:35,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:35,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:23:35,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:35,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:23:35,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:23:35,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:23:35,141 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-24 15:23:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:35,367 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-24 15:23:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:23:35,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 15:23:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:35,377 INFO L225 Difference]: With dead ends: 71 [2018-01-24 15:23:35,377 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:23:35,380 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 15:23:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:23:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:23:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:23:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 15:23:35,410 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-24 15:23:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:35,411 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 15:23:35,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:23:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 15:23:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:23:35,411 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:35,411 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:35,411 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-01-24 15:23:35,412 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:35,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:35,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,413 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:35,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:35,556 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 15:23:35,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:35,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:23:35,556 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:35,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:23:35,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:23:35,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:35,559 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-01-24 15:23:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:35,670 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 15:23:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:23:35,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 15:23:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:35,672 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:23:35,672 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 15:23:35,673 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:23:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 15:23:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 15:23:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:23:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 15:23:35,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-01-24 15:23:35,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:35,680 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 15:23:35,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:23:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 15:23:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:23:35,681 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:35,681 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:35,682 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-01-24 15:23:35,682 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:35,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:35,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,684 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:35,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:35,734 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 15:23:35,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:35,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:23:35,735 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:35,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:23:35,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:23:35,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:23:35,736 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-01-24 15:23:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:35,818 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 15:23:35,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:23:35,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:23:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:35,819 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:23:35,819 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 15:23:35,820 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 15:23:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 15:23:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 15:23:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:23:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 15:23:35,827 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-24 15:23:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:35,828 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 15:23:35,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:23:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 15:23:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:23:35,829 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:35,829 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:35,829 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-01-24 15:23:35,829 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:35,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:35,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,831 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:35,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:35,927 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 15:23:35,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:35,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:23:35,927 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:35,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:23:35,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:23:35,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:23:35,928 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-24 15:23:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:35,977 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 15:23:35,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:23:35,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:23:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:35,979 INFO L225 Difference]: With dead ends: 49 [2018-01-24 15:23:35,979 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 15:23:35,979 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 15:23:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 15:23:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 15:23:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 15:23:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 15:23:35,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-01-24 15:23:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:35,986 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 15:23:35,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:23:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 15:23:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:23:35,987 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:35,987 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 15:23:35,987 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-01-24 15:23:35,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:35,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:35,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:35,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:36,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:36,051 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 15:23:36,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:36,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:23:36,051 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:36,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:23:36,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:23:36,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:23:36,052 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-24 15:23:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:36,127 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-24 15:23:36,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:23:36,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 15:23:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:36,129 INFO L225 Difference]: With dead ends: 48 [2018-01-24 15:23:36,129 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:23:36,129 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 15:23:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:23:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:23:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:23:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-24 15:23:36,136 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-01-24 15:23:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:36,136 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-24 15:23:36,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:23:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-24 15:23:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:23:36,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:36,138 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 15:23:36,138 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:36,138 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-01-24 15:23:36,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:36,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:36,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:36,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:36,264 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 15:23:36,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:36,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:23:36,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:36,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:23:36,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:23:36,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:23:36,265 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-01-24 15:23:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:36,405 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 15:23:36,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:23:36,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 15:23:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:36,408 INFO L225 Difference]: With dead ends: 69 [2018-01-24 15:23:36,409 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 15:23:36,409 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:23:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 15:23:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-01-24 15:23:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 15:23:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-01-24 15:23:36,414 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-01-24 15:23:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:36,414 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-01-24 15:23:36,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:23:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-01-24 15:23:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:23:36,415 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:36,415 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 15:23:36,415 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-01-24 15:23:36,415 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:36,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:36,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,416 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:36,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:36,454 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 15:23:36,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:36,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:23:36,454 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:36,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:23:36,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:23:36,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:23:36,455 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-01-24 15:23:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:36,552 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-01-24 15:23:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:23:36,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 15:23:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:36,553 INFO L225 Difference]: With dead ends: 57 [2018-01-24 15:23:36,554 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 15:23:36,554 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 15:23:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 15:23:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 15:23:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 15:23:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-24 15:23:36,560 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-01-24 15:23:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:36,561 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-24 15:23:36,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:23:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-24 15:23:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:23:36,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:36,562 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 15:23:36,562 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-01-24 15:23:36,562 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:36,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:36,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:36,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:36,675 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 15:23:36,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:36,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:23:36,675 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:36,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:23:36,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:23:36,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:23:36,677 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-01-24 15:23:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:36,781 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-01-24 15:23:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:23:36,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 15:23:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:36,782 INFO L225 Difference]: With dead ends: 73 [2018-01-24 15:23:36,782 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 15:23:36,783 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 15:23:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 15:23:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-01-24 15:23:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 15:23:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-01-24 15:23:36,790 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-01-24 15:23:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:36,791 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-01-24 15:23:36,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:23:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-01-24 15:23:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:23:36,792 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:36,792 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 15:23:36,793 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-01-24 15:23:36,793 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:36,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:36,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:36,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:36,821 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 15:23:36,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:36,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:23:36,822 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:36,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:23:36,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:23:36,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:23:36,823 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-01-24 15:23:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:36,830 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-01-24 15:23:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:23:36,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-24 15:23:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:36,832 INFO L225 Difference]: With dead ends: 107 [2018-01-24 15:23:36,832 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 15:23:36,833 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 15:23:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 15:23:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-01-24 15:23:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 15:23:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-01-24 15:23:36,838 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-01-24 15:23:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:36,838 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-01-24 15:23:36,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:23:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-01-24 15:23:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:23:36,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:36,839 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 15:23:36,839 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:36,839 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-01-24 15:23:36,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:36,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:36,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:36,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:36,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:37,224 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 15:23:37,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:37,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 15:23:37,224 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:37,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:23:37,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:23:37,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:23:37,225 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-01-24 15:23:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:37,672 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-01-24 15:23:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 15:23:37,673 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-24 15:23:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:37,674 INFO L225 Difference]: With dead ends: 140 [2018-01-24 15:23:37,674 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 15:23:37,675 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-01-24 15:23:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 15:23:37,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-24 15:23:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 15:23:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-01-24 15:23:37,686 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-01-24 15:23:37,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:37,687 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-01-24 15:23:37,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:23:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-01-24 15:23:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:23:37,688 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:37,688 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 15:23:37,688 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-01-24 15:23:37,689 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:37,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:37,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:37,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:37,690 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:37,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:38,038 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 15:23:38,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:23:38,038 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:23:38,039 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:23:38,041 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 15:23:38,089 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:23:38,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:23:39,744 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:23:39,745 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 15:23:39,781 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:23:39,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:23:39,781 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 15:23:39,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:39,797 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:23:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:39,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:23:39,878 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 15:23:39,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:39,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:39,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:23:40,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:40,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:40,060 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 15:23:40,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:40,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:40,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 15:23:40,149 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 15:23:40,152 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 15:23:40,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:40,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:40,163 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 15:23:40,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 15:23:40,209 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 15:23:40,224 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 15:23:40,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:40,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:40,238 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 15:23:40,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 15:23:41,251 WARN L143 SmtUtils]: Spent 668ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-24 15:23:41,390 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 15:23:41,439 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 15:23:41,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-24 15:23:41,574 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 15:23:41,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:41,582 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 15:23:41,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:41,584 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 15:23:41,585 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:41,638 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 15:23:41,639 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:41,699 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 15:23:41,700 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:41,789 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 15:23:41,790 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:41,851 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 15:23:41,852 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-24 15:23:41,948 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 15:23:41,949 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-24 15:23:42,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-24 15:23:42,067 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 15:23:42,067 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-24 15:23:42,121 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 15:23:42,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:23:43,211 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 15:23:43,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,226 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 15:23:43,260 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 15:23:43,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,272 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 15:23:43,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,285 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 15:23:43,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-01-24 15:23:43,321 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 15:23:43,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:23:43,342 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 15:23:43,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:43,345 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:23:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:43,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:23:43,397 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 15:23:43,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,402 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 15:23:43,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:23:43,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:43,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:43,471 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 15:23:43,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,477 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 15:23:43,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 15:23:43,552 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 15:23:43,556 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 15:23:43,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 15:23:43,620 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 15:23:43,622 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 15:23:43,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,631 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 15:23:43,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 15:23:43,782 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 15:23:43,784 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 15:23:43,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:43,793 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 15:23:43,794 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:23:43,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:23:43,805 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 15:23:43,805 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 15:23:44,044 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 15:23:44,045 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:23:44,403 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 15:23:44,412 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 15:23:44,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:44,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:44,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:44,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 15:23:44,585 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 15:23:44,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:23:44,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13, 13, 11] total 61 [2018-01-24 15:23:44,587 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:23:44,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 15:23:44,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 15:23:44,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3511, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 15:23:44,590 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 30 states. [2018-01-24 15:23:46,798 WARN L146 SmtUtils]: Spent 1376ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-01-24 15:23:49,597 WARN L146 SmtUtils]: Spent 1327ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-01-24 15:23:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:49,863 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2018-01-24 15:23:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 15:23:49,863 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-01-24 15:23:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:49,864 INFO L225 Difference]: With dead ends: 110 [2018-01-24 15:23:49,864 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 15:23:49,866 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=644, Invalid=6162, Unknown=0, NotChecked=0, Total=6806 [2018-01-24 15:23:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 15:23:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-24 15:23:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 15:23:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-01-24 15:23:49,873 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 29 [2018-01-24 15:23:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:49,874 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-01-24 15:23:49,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 15:23:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-01-24 15:23:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:23:49,875 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:49,875 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 15:23:49,876 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-01-24 15:23:49,876 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:49,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:49,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:49,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:49,877 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:49,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:49,972 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 15:23:49,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:49,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:23:49,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:49,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:23:49,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:23:49,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:49,973 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2018-01-24 15:23:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:50,080 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-01-24 15:23:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:23:50,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 15:23:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:50,081 INFO L225 Difference]: With dead ends: 89 [2018-01-24 15:23:50,081 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 15:23:50,081 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 15:23:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 15:23:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-24 15:23:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 15:23:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-01-24 15:23:50,088 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 31 [2018-01-24 15:23:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:50,088 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-01-24 15:23:50,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:23:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-01-24 15:23:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:23:50,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:50,089 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 15:23:50,089 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:23:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-01-24 15:23:50,090 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:50,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:50,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:50,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:50,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:50,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:50,299 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 15:23:50,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:23:50,300 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:23:50,300 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 15:23:50,300 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 15:23:50,302 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:23:50,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:23:52,024 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:23:52,025 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 15:23:52,029 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:23:52,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:23:52,030 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 15:23:52,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:52,042 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:23:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:52,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:23:52,176 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 15:23:52,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:23:52,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:52,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:52,361 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 15:23:52,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 15:23:52,548 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 15:23:52,557 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 15:23:52,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-24 15:23:52,664 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 15:23:52,668 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 15:23:52,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:52,734 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 15:23:52,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-24 15:23:52,998 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 15:23:53,001 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 15:23:53,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:53,037 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 15:23:53,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:53,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:53,054 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 15:23:53,054 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-01-24 15:23:53,240 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 15:23:53,240 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:23:53,585 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 15:23:53,594 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 15:23:53,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:53,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:53,597 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 15:23:53,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-01-24 15:23:53,640 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 15:23:53,661 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:23:53,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 9] imperfect sequences [11] total 27 [2018-01-24 15:23:53,662 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:53,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:23:53,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:23:53,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2018-01-24 15:23:53,663 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 13 states. [2018-01-24 15:23:56,251 WARN L143 SmtUtils]: Spent 2448ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-24 15:23:59,870 WARN L143 SmtUtils]: Spent 3595ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 15:24:03,178 WARN L143 SmtUtils]: Spent 3292ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-24 15:24:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:24:03,219 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 15:24:03,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:24:03,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-01-24 15:24:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:24:03,220 INFO L225 Difference]: With dead ends: 75 [2018-01-24 15:24:03,221 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 15:24:03,221 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 15:24:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 15:24:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 15:24:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 15:24:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 15:24:03,227 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2018-01-24 15:24:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:24:03,227 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 15:24:03,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:24:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 15:24:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:24:03,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:24:03,228 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 15:24:03,228 INFO L371 AbstractCegarLoop]: === Iteration 14 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:24:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1784966119, now seen corresponding path program 1 times [2018-01-24 15:24:03,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:24:03,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:24:03,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:24:03,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:24:03,230 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:24:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:24:03,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:24:03,489 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 15:24:03,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:03,489 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:24:03,489 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-24 15:24:03,490 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 15:24:03,494 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:24:03,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:24:04,367 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:24:04,367 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 15:24:04,368 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:24:04,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:04,369 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 15:24:04,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:24:04,387 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:24:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:24:04,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:24:04,459 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 15:24:04,473 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 15:24:04,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:04,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:04,523 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 15:24:04,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:24:04,721 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 15:24:04,765 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 15:24:04,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:24:04,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:24:04,818 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 15:24:04,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 15:24:04,903 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 15:24:04,903 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:24:05,119 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 15:24:05,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,125 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 15:24:05,146 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 15:24:05,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,152 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 15:24:05,152 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 15:24:05,157 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 15:24:05,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:05,177 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 15:24:05,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:24:05,180 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:24:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:24:05,241 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:24:05,244 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 15:24:05,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:24:05,287 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 15:24:05,288 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 15:24:05,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:24:05,512 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 15:24:05,518 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 15:24:05,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:24:05,539 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 15:24:05,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,540 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 15:24:05,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,562 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 15:24:05,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-24 15:24:05,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 15:24:05,617 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 15:24:05,617 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:42, output treesize:62 [2018-01-24 15:24:05,715 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 15:24:05,715 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:24:05,960 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 15:24:05,968 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 15:24:05,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:05,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 15:24:06,061 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 15:24:06,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:24:06,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 14, 15] total 45 [2018-01-24 15:24:06,063 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:24:06,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 15:24:06,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 15:24:06,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 15:24:06,064 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 18 states. [2018-01-24 15:24:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:24:06,634 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-01-24 15:24:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:24:06,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-01-24 15:24:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:24:06,634 INFO L225 Difference]: With dead ends: 59 [2018-01-24 15:24:06,635 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 15:24:06,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 15:24:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 15:24:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-01-24 15:24:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 15:24:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 15:24:06,639 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 32 [2018-01-24 15:24:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:24:06,639 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 15:24:06,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 15:24:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 15:24:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 15:24:06,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:24:06,640 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 15:24:06,640 INFO L371 AbstractCegarLoop]: === Iteration 15 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:24:06,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1498931688, now seen corresponding path program 2 times [2018-01-24 15:24:06,641 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:24:06,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:24:06,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:24:06,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:24:06,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:24:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:24:06,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:24:07,118 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 15:24:07,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:07,119 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:24:07,119 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:24:07,119 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:24:07,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:07,119 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 15:24:07,124 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:24:07,124 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:24:07,135 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:24:07,142 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:24:07,144 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:24:07,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:24:07,150 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 15:24:07,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:07,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:07,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:24:07,181 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 15:24:07,182 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 15:24:07,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:07,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:07,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:07,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 15:24:07,435 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 15:24:07,441 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 15:24:07,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:24:07,467 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 15:24:07,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-24 15:24:07,500 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 15:24:07,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:07,502 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 15:24:07,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:07,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 15:24:07,562 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 15:24:07,563 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:53, output treesize:98 [2018-01-24 15:24:07,618 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 15:24:07,618 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:24:08,230 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 15:24:08,319 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 15:24:08,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,352 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 15:24:08,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, 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 15:24:08,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,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, 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 15:24:08,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,450 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 15:24:08,477 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 15:24:08,478 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,489 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 15:24:08,490 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,504 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 15:24:08,571 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 15:24:08,572 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,601 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 15:24:08,601 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,643 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 15:24:08,643 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,659 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:08,701 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 15:24:08,701 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:149, output treesize:98 [2018-01-24 15:24:08,903 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 15:24:08,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:08,935 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 15:24:08,939 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:24:08,939 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:24:08,963 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:24:09,024 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:24:09,085 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:24:09,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:24:09,108 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 15:24:09,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:09,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:09,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:24:09,149 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 15:24:09,153 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 15:24:09,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:09,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:09,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:09,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 15:24:09,555 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 15:24:09,557 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 15:24:09,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:09,568 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 15:24:09,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:09,585 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 15:24:09,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-24 15:24:09,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:24:09,630 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 15:24:09,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:76 [2018-01-24 15:24:09,691 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 15:24:09,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:24:10,206 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 15:24:10,233 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 15:24:10,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:10,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:10,247 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 15:24:10,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:35 [2018-01-24 15:24:10,382 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 15:24:10,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:24:10,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14, 15, 15] total 59 [2018-01-24 15:24:10,384 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:24:10,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 15:24:10,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 15:24:10,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=3187, Unknown=0, NotChecked=0, Total=3540 [2018-01-24 15:24:10,386 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 27 states. [2018-01-24 15:24:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:24:12,690 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-01-24 15:24:12,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 15:24:12,690 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-24 15:24:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:24:12,691 INFO L225 Difference]: With dead ends: 74 [2018-01-24 15:24:12,691 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 15:24:12,693 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 15:24:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 15:24:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2018-01-24 15:24:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:24:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 15:24:12,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 43 [2018-01-24 15:24:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:24:12,697 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 15:24:12,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 15:24:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 15:24:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 15:24:12,697 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:24:12,697 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 15:24:12,697 INFO L371 AbstractCegarLoop]: === Iteration 16 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:24:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 276075674, now seen corresponding path program 1 times [2018-01-24 15:24:12,698 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:24:12,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:24:12,698 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:24:12,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:24:12,698 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:24:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:24:12,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:24:13,041 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 15:24:13,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:13,041 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:24:13,041 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-24 15:24:13,041 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 15:24:13,042 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:24:13,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:24:14,045 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:24:14,045 INFO L268 AbstractInterpreter]: Visited 29 different actions 56 times. Merged at 13 different actions 25 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 31 variables. [2018-01-24 15:24:14,069 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:24:14,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:14,069 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 15:24:14,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:24:14,079 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:24:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:24:14,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:24:14,120 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 15:24:14,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:14,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:14,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:24:14,145 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 15:24:14,146 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 15:24:14,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:14,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:14,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:14,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 15:24:14,226 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 15:24:14,236 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 15:24:14,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:24:14,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:24:14,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:24:14,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 15:24:14,324 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 15:24:14,324 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:24:14,832 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 15:24:14,840 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 15:24:14,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:14,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:14,847 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 15:24:14,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 15:24:14,927 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 15:24:14,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:24:14,947 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 15:24:14,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:24:14,954 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:24:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:24:15,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:24:15,034 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 15:24:15,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:15,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:15,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:24:15,042 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 15:24:15,043 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 15:24:15,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:15,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:15,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:15,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 15:24:15,125 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 15:24:15,130 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 15:24:15,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:24:15,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:24:15,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:24:15,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-01-24 15:24:15,154 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 15:24:15,154 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:24:15,303 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 15:24:15,310 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 15:24:15,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:15,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:15,317 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 15:24:15,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 15:24:15,404 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 15:24:15,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:24:15,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 11, 11] total 39 [2018-01-24 15:24:15,406 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:24:15,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 15:24:15,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 15:24:15,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1413, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 15:24:15,407 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 20 states. [2018-01-24 15:24:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:24:15,960 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-01-24 15:24:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:24:15,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-01-24 15:24:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:24:15,960 INFO L225 Difference]: With dead ends: 64 [2018-01-24 15:24:15,960 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:24:15,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=370, Invalid=2180, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 15:24:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:24:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:24:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:24:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:24:15,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-01-24 15:24:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:24:15,962 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:24:15,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 15:24:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:24:15,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:24:15,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:24:16,721 WARN L146 SmtUtils]: Spent 643ms on a formula simplification. DAG size of input: 169 DAG size of output 125 [2018-01-24 15:24:16,979 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 98 DAG size of output 71 [2018-01-24 15:24:16,982 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point subseqErr5RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point L544'''''''''(lines 544 549) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point subseqErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point subseqErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L404 ceAbstractionStarter]: At program point subseqENTRY(lines 540 552) the Hoare annotation is: true [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point subseqErr9RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point L545''''(lines 545 547) no Hoare annotation was computed. [2018-01-24 15:24:16,983 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point subseqErr8RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point subseqFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point subseqErr4RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,984 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 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point subseqErr7RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point subseqEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point subseqErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point subseqErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,984 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point subseqErr6RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 567) the Hoare annotation is: true [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 567) the Hoare annotation is: true [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-24 15:24:16,985 INFO L401 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-24 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-24 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-24 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-24 15:24:16,986 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 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-24 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 567) no Hoare annotation was computed. [2018-01-24 15:24:16,986 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 567) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 553 567) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 567) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 567) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point L563''(line 563) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point L563'''(line 563) no Hoare annotation was computed. [2018-01-24 15:24:16,987 INFO L401 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-24 15:24:16,998 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:16,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:16,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:16,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,000 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 15:24:17,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,000 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 15:24:17,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,001 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 15:24:17,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,002 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 15:24:17,002 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 15:24:17,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,002 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 15:24:17,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:17,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,004 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 15:24:17,004 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 15:24:17,004 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 15:24:17,004 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 15:24:17,005 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 15:24:17,005 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 15:24:17,005 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 15:24:17,005 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 15:24:17,005 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,006 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 15:24:17,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,006 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 15:24:17,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,006 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 15:24:17,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,007 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 15:24:17,007 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 15:24:17,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,007 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 15:24:17,007 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,007 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 15:24:17,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,008 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 15:24:17,008 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 15:24:17,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,009 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 15:24:17,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,009 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 15:24:17,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,009 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 15:24:17,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,016 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:17,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,029 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 15:24:17,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,030 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 15:24:17,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,030 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 15:24:17,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,031 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 15:24:17,031 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 15:24:17,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,032 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 15:24:17,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,032 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:17,033 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,033 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 15:24:17,033 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 15:24:17,034 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 15:24:17,034 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 15:24:17,034 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 15:24:17,034 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 15:24:17,034 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 15:24:17,035 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 15:24:17,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,035 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 15:24:17,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,036 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 15:24:17,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,036 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 15:24:17,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,037 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 15:24:17,037 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 15:24:17,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,037 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 15:24:17,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,038 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 15:24:17,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,038 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 15:24:17,039 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 15:24:17,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,039 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 15:24:17,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,039 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 15:24:17,040 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,040 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 15:24:17,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,042 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,043 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,044 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:24:17 BoogieIcfgContainer [2018-01-24 15:24:17,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:24:17,049 INFO L168 Benchmark]: Toolchain (without parser) took 42814.15 ms. Allocated memory was 308.8 MB in the beginning and 782.8 MB in the end (delta: 474.0 MB). Free memory was 268.9 MB in the beginning and 668.1 MB in the end (delta: -399.3 MB). Peak memory consumption was 428.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:24:17,050 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:24:17,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.21 ms. Allocated memory is still 308.8 MB. Free memory was 267.9 MB in the beginning and 257.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:24:17,050 INFO L168 Benchmark]: Boogie Preprocessor took 32.65 ms. Allocated memory is still 308.8 MB. Free memory was 257.9 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:24:17,051 INFO L168 Benchmark]: RCFGBuilder took 269.60 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 237.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:24:17,051 INFO L168 Benchmark]: TraceAbstraction took 42290.71 ms. Allocated memory was 308.8 MB in the beginning and 782.8 MB in the end (delta: 474.0 MB). Free memory was 237.2 MB in the beginning and 668.1 MB in the end (delta: -430.9 MB). Peak memory consumption was 397.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:24:17,053 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.19 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.21 ms. Allocated memory is still 308.8 MB. Free memory was 267.9 MB in the beginning and 257.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.65 ms. Allocated memory is still 308.8 MB. Free memory was 257.9 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 269.60 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 237.2 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42290.71 ms. Allocated memory was 308.8 MB in the beginning and 782.8 MB in the end (delta: 474.0 MB). Free memory was 237.2 MB in the beginning and 668.1 MB in the end (delta: -430.9 MB). Peak memory consumption was 397.0 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 : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 380 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.738058 RENAME_VARIABLES(MILLISECONDS) : 0.171602 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.776559 PROJECTAWAY(MILLISECONDS) : 0.032943 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.108642 DISJOIN(MILLISECONDS) : 0.439951 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.191909 ADD_EQUALITY(MILLISECONDS) : 0.016141 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014188 #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 : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 356 LocStat_NO_SUPPORTING_DISEQUALITIES : 62 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.952194 RENAME_VARIABLES(MILLISECONDS) : 0.389750 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.488077 PROJECTAWAY(MILLISECONDS) : 0.082190 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054811 DISJOIN(MILLISECONDS) : 0.374359 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.410610 ADD_EQUALITY(MILLISECONDS) : 0.019553 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009335 #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 : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 378 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.119346 RENAME_VARIABLES(MILLISECONDS) : 0.137112 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.543029 PROJECTAWAY(MILLISECONDS) : 0.037685 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056593 DISJOIN(MILLISECONDS) : 0.273040 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.152898 ADD_EQUALITY(MILLISECONDS) : 0.019024 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008028 #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 : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 382 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.570632 RENAME_VARIABLES(MILLISECONDS) : 0.335069 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.536576 PROJECTAWAY(MILLISECONDS) : 0.223243 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.052465 DISJOIN(MILLISECONDS) : 0.416323 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.361379 ADD_EQUALITY(MILLISECONDS) : 0.015761 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009262 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 173 #UNFREEZE : 0 #CONJOIN : 160 #PROJECTAWAY : 128 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 161 #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 15:24:17,068 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,068 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,068 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:17,069 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,069 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 15:24:17,069 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,069 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,069 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 15:24:17,070 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,070 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 15:24:17,070 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,070 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 15:24:17,071 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 15:24:17,071 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,071 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,071 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 15:24:17,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:17,072 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,072 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 15:24:17,073 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 15:24:17,073 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 15:24:17,073 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 15:24:17,073 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 15:24:17,073 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 15:24:17,074 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 15:24:17,074 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 15:24:17,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,074 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 15:24:17,074 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,075 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 15:24:17,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,075 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 15:24:17,075 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,075 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 15:24:17,076 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 15:24:17,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,076 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 15:24:17,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,076 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 15:24:17,076 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,076 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 15:24:17,077 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 15:24:17,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,077 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 15:24:17,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,077 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 15:24:17,077 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,077 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 15:24:17,077 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,078 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:17,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,086 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 15:24:17,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,086 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 15:24:17,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,087 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 15:24:17,087 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,087 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 15:24:17,087 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 15:24:17,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,088 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 15:24:17,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.offset,QUANTIFIED] [2018-01-24 15:24:17,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~5.base,QUANTIFIED] [2018-01-24 15:24:17,089 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 15:24:17,089 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 15:24:17,089 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 15:24:17,090 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 15:24:17,090 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 15:24:17,090 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 15:24:17,090 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 15:24:17,090 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 15:24:17,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,090 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 15:24:17,090 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,091 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 15:24:17,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,091 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 15:24:17,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,091 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 15:24:17,091 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 15:24:17,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,091 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,092 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 15:24:17,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,092 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 15:24:17,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,092 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 15:24:17,092 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 15:24:17,092 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~5,QUANTIFIED] [2018-01-24 15:24:17,092 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 15:24:17,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,093 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 15:24:17,093 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 15:24:17,093 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 15:24:17,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,096 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:24:17,097 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,097 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:24:17,097 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, 42.1s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 19.7s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 877 GetRequests, 478 SyntacticMatches, 21 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 5292 ImplicationChecksByTransitivity, 27.4s 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, 5.3s 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.6s SatisfiabilityAnalysisTime, 14.7s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-24-17-101.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-24-17-101.csv Received shutdown request...