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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:13:18,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:13:18,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:13:18,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:13:18,248 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:13:18,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:13:18,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:13:18,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:13:18,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:13:18,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:13:18,255 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:13:18,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:13:18,256 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:13:18,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:13:18,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:13:18,261 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:13:18,263 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:13:18,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:13:18,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:13:18,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:13:18,270 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:13:18,270 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:13:18,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:13:18,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:13:18,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:13:18,273 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:13:18,273 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:13:18,274 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:13:18,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:13:18,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:13:18,275 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:13:18,275 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:13:18,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:13:18,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:13:18,285 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:13:18,285 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:13:18,285 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:13:18,285 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:13:18,285 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:13:18,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:13:18,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:13:18,286 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:13:18,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:13:18,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:13:18,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:13:18,287 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:13:18,287 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:13:18,287 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:13:18,287 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:13:18,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:13:18,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:13:18,287 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:13:18,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:13:18,288 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:13:18,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:13:18,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:13:18,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:13:18,288 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:13:18,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:13:18,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:13:18,289 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:13:18,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:13:18,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:13:18,289 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:13:18,290 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:13:18,290 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:13:18,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:13:18,331 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:13:18,335 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:13:18,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:13:18,336 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:13:18,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-01-24 13:13:18,498 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:13:18,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:13:18,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:13:18,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:13:18,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:13:18,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c1919f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18, skipping insertion in model container [2018-01-24 13:13:18,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,541 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:13:18,579 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:13:18,698 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:13:18,722 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:13:18,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18 WrapperNode [2018-01-24 13:13:18,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:13:18,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:13:18,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:13:18,733 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:13:18,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (1/1) ... [2018-01-24 13:13:18,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:13:18,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:13:18,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:13:18,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:13:18,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (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 13:13:18,822 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:13:18,822 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:13:18,822 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 13:13:18,823 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:13:18,823 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-24 13:13:18,824 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:13:18,824 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 13:13:18,824 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:13:18,824 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:13:18,824 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:13:19,266 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:13:19,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:13:19 BoogieIcfgContainer [2018-01-24 13:13:19,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:13:19,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:13:19,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:13:19,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:13:19,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:13:18" (1/3) ... [2018-01-24 13:13:19,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8b5a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:13:19, skipping insertion in model container [2018-01-24 13:13:19,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:13:18" (2/3) ... [2018-01-24 13:13:19,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8b5a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:13:19, skipping insertion in model container [2018-01-24 13:13:19,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:13:19" (3/3) ... [2018-01-24 13:13:19,274 INFO L105 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-01-24 13:13:19,283 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:13:19,290 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-24 13:13:19,334 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:13:19,334 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:13:19,334 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:13:19,334 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:13:19,334 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:13:19,334 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:13:19,334 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:13:19,335 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:13:19,335 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:13:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-01-24 13:13:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:13:19,358 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:19,359 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:19,359 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times [2018-01-24 13:13:19,365 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:19,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:19,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:19,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:19,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:19,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:19,529 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 13:13:19,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:19,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:13:19,532 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:19,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:13:19,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:13:19,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:13:19,553 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-01-24 13:13:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:19,919 INFO L93 Difference]: Finished difference Result 268 states and 291 transitions. [2018-01-24 13:13:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:13:19,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:13:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:19,930 INFO L225 Difference]: With dead ends: 268 [2018-01-24 13:13:19,930 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 13:13:19,933 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 13:13:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 13:13:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-01-24 13:13:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 13:13:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-01-24 13:13:19,970 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2018-01-24 13:13:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:19,970 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-01-24 13:13:19,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:13:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-01-24 13:13:19,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:13:19,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:19,971 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:19,971 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times [2018-01-24 13:13:19,971 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:19,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:19,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:19,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:19,972 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:19,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:20,044 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 13:13:20,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:20,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:13:20,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:20,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:13:20,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:13:20,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:13:20,046 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states. [2018-01-24 13:13:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:20,234 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-01-24 13:13:20,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:13:20,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:13:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:20,236 INFO L225 Difference]: With dead ends: 128 [2018-01-24 13:13:20,237 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 13:13:20,237 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 13:13:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 13:13:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-24 13:13:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 13:13:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-01-24 13:13:20,248 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8 [2018-01-24 13:13:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:20,248 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-01-24 13:13:20,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:13:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-01-24 13:13:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:13:20,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:20,249 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:20,250 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times [2018-01-24 13:13:20,250 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:20,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:20,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:20,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:20,298 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 13:13:20,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:20,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:13:20,299 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:20,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:13:20,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:13:20,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:13:20,300 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2018-01-24 13:13:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:20,435 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-24 13:13:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:13:20,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-24 13:13:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:20,438 INFO L225 Difference]: With dead ends: 139 [2018-01-24 13:13:20,438 INFO L226 Difference]: Without dead ends: 136 [2018-01-24 13:13:20,439 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 13:13:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-24 13:13:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-01-24 13:13:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 13:13:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-01-24 13:13:20,446 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12 [2018-01-24 13:13:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:20,446 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-01-24 13:13:20,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:13:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-01-24 13:13:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:13:20,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:20,447 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:20,447 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times [2018-01-24 13:13:20,447 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:20,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:20,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:20,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:20,512 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 13:13:20,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:20,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:13:20,512 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:20,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:13:20,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:13:20,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:13:20,513 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-01-24 13:13:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:20,622 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-24 13:13:20,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:13:20,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-01-24 13:13:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:20,623 INFO L225 Difference]: With dead ends: 128 [2018-01-24 13:13:20,623 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 13:13:20,623 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 13:13:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 13:13:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-01-24 13:13:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 13:13:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-24 13:13:20,633 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12 [2018-01-24 13:13:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:20,633 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-24 13:13:20,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:13:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-24 13:13:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:13:20,634 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:20,634 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] [2018-01-24 13:13:20,634 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times [2018-01-24 13:13:20,635 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:20,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:20,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:20,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:20,714 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 13:13:20,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:20,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:13:20,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:20,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:13:20,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:13:20,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:13:20,715 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states. [2018-01-24 13:13:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:20,838 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-01-24 13:13:20,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:13:20,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 13:13:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:20,840 INFO L225 Difference]: With dead ends: 124 [2018-01-24 13:13:20,840 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 13:13:20,840 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 13:13:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 13:13:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-24 13:13:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-24 13:13:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-24 13:13:20,849 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20 [2018-01-24 13:13:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:20,849 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-24 13:13:20,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:13:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-24 13:13:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:13:20,850 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:20,851 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] [2018-01-24 13:13:20,851 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times [2018-01-24 13:13:20,851 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:20,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:20,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:20,852 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:20,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:20,924 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 13:13:20,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:20,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:13:20,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:20,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:13:20,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:13:20,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:13:20,925 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-01-24 13:13:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:21,000 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-01-24 13:13:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:13:21,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-24 13:13:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:21,002 INFO L225 Difference]: With dead ends: 119 [2018-01-24 13:13:21,002 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 13:13:21,002 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 13:13:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 13:13:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 13:13:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:13:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-01-24 13:13:21,011 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2018-01-24 13:13:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:21,012 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-01-24 13:13:21,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:13:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-01-24 13:13:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 13:13:21,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:21,013 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 13:13:21,013 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:21,013 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times [2018-01-24 13:13:21,014 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:21,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:21,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:21,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:21,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:21,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:13:21,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:21,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:13:21,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:21,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:13:21,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:13:21,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:13:21,134 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 8 states. [2018-01-24 13:13:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:21,500 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2018-01-24 13:13:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:13:21,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 13:13:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:21,501 INFO L225 Difference]: With dead ends: 185 [2018-01-24 13:13:21,501 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 13:13:21,502 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:13:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 13:13:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2018-01-24 13:13:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 13:13:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-01-24 13:13:21,509 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 21 [2018-01-24 13:13:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:21,509 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-01-24 13:13:21,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:13:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-01-24 13:13:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 13:13:21,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:21,510 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 13:13:21,510 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash -276644943, now seen corresponding path program 1 times [2018-01-24 13:13:21,510 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:21,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:21,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:21,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:21,511 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:21,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:21,655 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 13:13:21,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:21,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:13:21,655 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:21,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:13:21,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:13:21,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:13:21,656 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 9 states. [2018-01-24 13:13:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:21,951 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2018-01-24 13:13:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:13:21,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 13:13:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:21,953 INFO L225 Difference]: With dead ends: 196 [2018-01-24 13:13:21,953 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 13:13:21,954 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:13:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 13:13:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2018-01-24 13:13:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 13:13:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2018-01-24 13:13:21,963 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 21 [2018-01-24 13:13:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:21,963 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2018-01-24 13:13:21,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:13:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2018-01-24 13:13:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:13:21,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:21,965 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] [2018-01-24 13:13:21,965 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:21,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1018638093, now seen corresponding path program 1 times [2018-01-24 13:13:21,965 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:21,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:21,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:21,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:21,966 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:21,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:22,309 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 13:13:22,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:22,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 13:13:22,310 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:22,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:13:22,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:13:22,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:13:22,311 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand 14 states. [2018-01-24 13:13:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:22,869 INFO L93 Difference]: Finished difference Result 376 states and 463 transitions. [2018-01-24 13:13:22,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 13:13:22,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-01-24 13:13:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:22,873 INFO L225 Difference]: With dead ends: 376 [2018-01-24 13:13:22,873 INFO L226 Difference]: Without dead ends: 228 [2018-01-24 13:13:22,874 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:13:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-01-24 13:13:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 171. [2018-01-24 13:13:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-24 13:13:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2018-01-24 13:13:22,887 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 30 [2018-01-24 13:13:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:22,887 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2018-01-24 13:13:22,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:13:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-01-24 13:13:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:13:22,888 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:22,889 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, 1] [2018-01-24 13:13:22,889 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2019932176, now seen corresponding path program 1 times [2018-01-24 13:13:22,889 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:22,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:22,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:22,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:22,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:22,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:23,430 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 13:13:23,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:23,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 13:13:23,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:23,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:13:23,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:13:23,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:13:23,432 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 14 states. [2018-01-24 13:13:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:23,916 INFO L93 Difference]: Finished difference Result 324 states and 393 transitions. [2018-01-24 13:13:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:13:23,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-01-24 13:13:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:23,918 INFO L225 Difference]: With dead ends: 324 [2018-01-24 13:13:23,918 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 13:13:23,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:13:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 13:13:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-01-24 13:13:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-24 13:13:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2018-01-24 13:13:23,929 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 32 [2018-01-24 13:13:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:23,929 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2018-01-24 13:13:23,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:13:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2018-01-24 13:13:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 13:13:23,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:23,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:23,931 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash -489397259, now seen corresponding path program 1 times [2018-01-24 13:13:23,931 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:23,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:23,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:23,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:23,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:23,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:23,996 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 13:13:23,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:13:23,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:13:23,997 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:13:23,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:13:23,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:13:23,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:13:23,998 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 3 states. [2018-01-24 13:13:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:24,018 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2018-01-24 13:13:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:13:24,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-01-24 13:13:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:24,022 INFO L225 Difference]: With dead ends: 207 [2018-01-24 13:13:24,022 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 13:13:24,023 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 13:13:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 13:13:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-01-24 13:13:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 13:13:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-01-24 13:13:24,033 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 40 [2018-01-24 13:13:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:24,034 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-01-24 13:13:24,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:13:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-01-24 13:13:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 13:13:24,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:24,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:24,035 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244567, now seen corresponding path program 1 times [2018-01-24 13:13:24,036 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:24,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:24,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:24,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:24,037 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:24,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:24,332 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 13:13:24,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:13:24,333 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 13:13:24,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:24,357 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:13:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:24,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:13:24,445 WARN L1029 $PredicateComparison]: unable to prove that (exists ((append_~node~4.base Int)) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= |c_#valid| (store |c_old(#valid)| append_~node~4.base 1)))) is different from true [2018-01-24 13:13:24,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:24,476 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:24,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-24 13:13:24,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:24,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:24,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 13:13:24,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-01-24 13:13:24,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:24,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:24,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-01-24 13:13:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 13:13:24,789 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:13:26,497 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 13:13:26,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:13:26,521 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 13:13:26,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:26,525 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:13:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:26,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:13:26,608 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 13:13:26,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:26,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:26,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:13:26,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:26,668 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:26,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-24 13:13:26,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:26,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:26,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 13:13:26,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-01-24 13:13:26,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:26,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:26,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-01-24 13:13:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 13:13:26,755 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:13:27,744 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 13:13:27,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:13:27,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9, 9, 8] total 23 [2018-01-24 13:13:27,746 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:13:27,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 13:13:27,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 13:13:27,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=4, NotChecked=42, Total=552 [2018-01-24 13:13:27,747 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 18 states. [2018-01-24 13:13:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:28,630 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-01-24 13:13:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:13:28,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-01-24 13:13:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:28,633 INFO L225 Difference]: With dead ends: 179 [2018-01-24 13:13:28,633 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 13:13:28,634 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 148 SyntacticMatches, 18 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=4, NotChecked=56, Total=930 [2018-01-24 13:13:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 13:13:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2018-01-24 13:13:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 13:13:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-01-24 13:13:28,644 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 43 [2018-01-24 13:13:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:28,644 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-01-24 13:13:28,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 13:13:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-01-24 13:13:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 13:13:28,646 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:28,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:28,646 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244566, now seen corresponding path program 1 times [2018-01-24 13:13:28,647 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:28,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:28,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:28,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:28,648 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:28,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:28,917 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 13:13:28,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:13:28,948 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 13:13:28,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:28,954 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:13:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:28,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:13:29,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:29,101 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 14 treesize of output 17 [2018-01-24 13:13:29,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:29,117 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:29,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:29,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-24 13:13:29,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:29,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:29,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30 [2018-01-24 13:13:29,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:29,240 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:29,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:29,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 13:13:29,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:29,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-01-24 13:13:29,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:29,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:29,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33 [2018-01-24 13:13:29,336 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 13:13:29,336 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:13:29,613 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 13:13:29,696 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-01-24 13:13:31,063 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 13:13:31,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:13:31,098 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:13:31,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:31,104 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:13:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:31,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:13:31,193 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 13:13:31,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:31,210 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 13:13:31,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:31,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:31,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 13:13:31,316 WARN L1029 $PredicateComparison]: unable to prove that (exists ((append_~node~4.base Int)) (and (= 0 (select |c_old(#valid)| append_~node~4.base)) (= (store |c_old(#length)| append_~node~4.base 9) |c_#length|))) is different from true [2018-01-24 13:13:31,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:31,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:31,330 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 13:13:31,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:31,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:31,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 21 [2018-01-24 13:13:31,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:31,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:31,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-01-24 13:13:31,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:31,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:31,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2018-01-24 13:13:31,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 13:13:31,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 13:13:31,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:38 [2018-01-24 13:13:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 13:13:31,743 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:13:32,709 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 13:13:40,716 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 13:13:40,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:13:40,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8, 10, 9] total 39 [2018-01-24 13:13:40,718 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:13:40,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 13:13:40,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 13:13:40,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1318, Unknown=8, NotChecked=74, Total=1560 [2018-01-24 13:13:40,720 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 19 states. [2018-01-24 13:13:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:13:42,312 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-01-24 13:13:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:13:42,312 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-01-24 13:13:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:13:42,313 INFO L225 Difference]: With dead ends: 176 [2018-01-24 13:13:42,314 INFO L226 Difference]: Without dead ends: 167 [2018-01-24 13:13:42,314 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=249, Invalid=1725, Unknown=10, NotChecked=86, Total=2070 [2018-01-24 13:13:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-24 13:13:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-01-24 13:13:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 13:13:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-01-24 13:13:42,324 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 43 [2018-01-24 13:13:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:13:42,324 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-01-24 13:13:42,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 13:13:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-01-24 13:13:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 13:13:42,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:13:42,326 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:13:42,326 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-01-24 13:13:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 570613669, now seen corresponding path program 1 times [2018-01-24 13:13:42,326 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:13:42,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:42,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:42,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:13:42,328 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:13:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:42,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:13:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:13:43,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:13:43,037 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:13:43,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:13:43,042 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:13:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:13:43,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:13:43,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-01-24 13:13:43,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 13:13:43,314 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 13 treesize of output 10 [2018-01-24 13:13:43,316 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 10 treesize of output 9 [2018-01-24 13:13:43,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 13:13:43,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-01-24 13:13:43,378 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 24 treesize of output 23 [2018-01-24 13:13:43,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-01-24 13:13:43,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 13:13:43,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:13:43,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:13:43,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-01-24 13:13:43,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-01-24 13:13:43,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:43,612 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 61 treesize of output 76 [2018-01-24 13:13:43,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:43,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 54 [2018-01-24 13:13:43,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 13:13:43,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:13:43,714 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 33 treesize of output 28 [2018-01-24 13:13:43,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:43,717 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 18 treesize of output 27 [2018-01-24 13:13:43,717 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 13:13:43,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-01-24 13:13:43,952 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-24 13:13:43,956 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-24 13:13:43,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:43,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:43,983 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 17 treesize of output 10 [2018-01-24 13:13:43,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:43,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:43,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-01-24 13:13:44,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:44,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:44,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:44,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-01-24 13:13:44,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:44,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-01-24 13:13:44,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-01-24 13:13:44,250 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 1 [2018-01-24 13:13:44,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,271 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 13:13:44,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:82 [2018-01-24 13:13:44,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-01-24 13:13:44,420 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 10 treesize of output 9 [2018-01-24 13:13:44,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:44,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-01-24 13:13:44,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-01-24 13:13:44,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 10 treesize of output 9 [2018-01-24 13:13:44,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,580 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 13:13:44,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-01-24 13:13:44,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-01-24 13:13:44,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:13:44,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 13:13:44,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,656 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 7 treesize of output 1 [2018-01-24 13:13:44,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,667 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:44,668 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 33 treesize of output 21 [2018-01-24 13:13:44,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:44,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:44,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-01-24 13:13:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:13:44,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:13:45,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:45,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:45,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:45,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:45,186 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:45,194 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:13:45,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-01-24 13:13:45,215 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:52, output treesize:124 [2018-01-24 13:13:45,680 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:45,681 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:45,683 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:45,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 271 [2018-01-24 13:13:45,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:45,703 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 153 [2018-01-24 13:13:45,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 10 [2018-01-24 13:13:45,756 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:45,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 101 [2018-01-24 13:13:45,920 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 86 DAG size of output 65 [2018-01-24 13:13:45,922 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-01-24 13:13:45,925 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:45,926 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 20 treesize of output 28 [2018-01-24 13:13:45,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:45,940 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:13:45,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 47 treesize of output 59 [2018-01-24 13:13:45,991 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 69 [2018-01-24 13:13:46,001 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-24 13:13:46,035 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,036 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 50 treesize of output 58 [2018-01-24 13:13:46,036 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 13:13:46,064 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:13:46,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-01-24 13:13:46,113 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-01-24 13:13:46,123 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-24 13:13:46,134 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:13:46,136 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-01-24 13:13:46,143 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,144 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-01-24 13:13:46,150 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-24 13:13:46,162 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:13:46,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-01-24 13:13:46,167 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,168 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,171 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:13:46,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 72 [2018-01-24 13:13:46,187 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-01-24 13:13:46,215 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:13:46,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 56 treesize of output 52 [2018-01-24 13:13:46,306 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_24 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:386) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 13:13:46,309 INFO L168 Benchmark]: Toolchain (without parser) took 27809.86 ms. Allocated memory was 297.3 MB in the beginning and 615.5 MB in the end (delta: 318.2 MB). Free memory was 257.3 MB in the beginning and 318.0 MB in the end (delta: -60.7 MB). Peak memory consumption was 257.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:13:46,310 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:13:46,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.82 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:13:46,310 INFO L168 Benchmark]: Boogie Preprocessor took 42.30 ms. Allocated memory is still 297.3 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:13:46,310 INFO L168 Benchmark]: RCFGBuilder took 491.56 ms. Allocated memory is still 297.3 MB. Free memory was 243.3 MB in the beginning and 209.7 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:13:46,310 INFO L168 Benchmark]: TraceAbstraction took 27040.40 ms. Allocated memory was 297.3 MB in the beginning and 615.5 MB in the end (delta: 318.2 MB). Free memory was 209.7 MB in the beginning and 318.0 MB in the end (delta: -108.4 MB). Peak memory consumption was 209.9 MB. Max. memory is 5.3 GB. [2018-01-24 13:13:46,312 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.11 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.82 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.30 ms. Allocated memory is still 297.3 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 491.56 ms. Allocated memory is still 297.3 MB. Free memory was 243.3 MB in the beginning and 209.7 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 27040.40 ms. Allocated memory was 297.3 MB in the beginning and 615.5 MB in the end (delta: 318.2 MB). Free memory was 209.7 MB in the beginning and 318.0 MB in the end (delta: -108.4 MB). Peak memory consumption was 209.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_24 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_24 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-13-46-320.csv Received shutdown request...