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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:34:21,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:34:21,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:34:21,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:34:21,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:34:21,465 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:34:21,466 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:34:21,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:34:21,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:34:21,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:34:21,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:34:21,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:34:21,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:34:21,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:34:21,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:34:21,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:34:21,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:34:21,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:34:21,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:34:21,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:34:21,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:34:21,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:34:21,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:34:21,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:34:21,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:34:21,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:34:21,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:34:21,486 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:34:21,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:34:21,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:34:21,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:34:21,486 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 18:34:21,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:34:21,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:34:21,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:34:21,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:34:21,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:34:21,497 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:34:21,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:34:21,498 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:34:21,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:34:21,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:34:21,498 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:34:21,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:34:21,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:34:21,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:34:21,499 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:34:21,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:34:21,499 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:34:21,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:34:21,534 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:34:21,536 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:34:21,537 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:34:21,538 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:34:21,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_true-valid-memsafety.i [2018-02-04 18:34:21,681 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:34:21,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:34:21,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:34:21,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:34:21,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:34:21,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a5865a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21, skipping insertion in model container [2018-02-04 18:34:21,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,706 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:34:21,738 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:34:21,843 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:34:21,872 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:34:21,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21 WrapperNode [2018-02-04 18:34:21,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:34:21,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:34:21,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:34:21,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:34:21,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... [2018-02-04 18:34:21,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:34:21,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:34:21,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:34:21,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:34:21,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 18:34:21,974 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:34:21,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:34:21,975 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-02-04 18:34:21,975 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-02-04 18:34:21,975 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 18:34:21,975 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:34:21,975 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:34:21,975 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:34:21,975 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:34:21,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:34:21,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:34:22,705 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:34:22,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:34:22 BoogieIcfgContainer [2018-02-04 18:34:22,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:34:22,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:34:22,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:34:22,709 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:34:22,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:34:21" (1/3) ... [2018-02-04 18:34:22,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb0f1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:34:22, skipping insertion in model container [2018-02-04 18:34:22,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:34:21" (2/3) ... [2018-02-04 18:34:22,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb0f1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:34:22, skipping insertion in model container [2018-02-04 18:34:22,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:34:22" (3/3) ... [2018-02-04 18:34:22,712 INFO L107 eAbstractionObserver]: Analyzing ICFG split_list_test05_true-valid-memsafety.i [2018-02-04 18:34:22,719 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:34:22,726 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-02-04 18:34:22,753 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:34:22,753 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:34:22,753 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:34:22,753 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:34:22,753 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:34:22,753 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:34:22,753 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:34:22,754 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:34:22,754 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:34:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states. [2018-02-04 18:34:22,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:34:22,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:22,778 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:22,778 INFO L371 AbstractCegarLoop]: === Iteration 1 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1352779119, now seen corresponding path program 1 times [2018-02-04 18:34:22,784 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:22,785 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:22,820 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:22,821 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:22,821 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:22,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:22,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:22,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:34:22,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:34:22,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:34:22,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:34:22,996 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 4 states. [2018-02-04 18:34:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:23,392 INFO L93 Difference]: Finished difference Result 388 states and 433 transitions. [2018-02-04 18:34:23,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:34:23,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 18:34:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:23,405 INFO L225 Difference]: With dead ends: 388 [2018-02-04 18:34:23,405 INFO L226 Difference]: Without dead ends: 385 [2018-02-04 18:34:23,407 INFO L554 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-02-04 18:34:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-04 18:34:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2018-02-04 18:34:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-04 18:34:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 389 transitions. [2018-02-04 18:34:23,446 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 389 transitions. Word has length 8 [2018-02-04 18:34:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:23,447 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 389 transitions. [2018-02-04 18:34:23,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:34:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 389 transitions. [2018-02-04 18:34:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:34:23,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:23,447 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:23,447 INFO L371 AbstractCegarLoop]: === Iteration 2 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1352779118, now seen corresponding path program 1 times [2018-02-04 18:34:23,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:23,448 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:23,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:23,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:23,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:23,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:23,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:23,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:34:23,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:34:23,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:34:23,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:34:23,507 INFO L87 Difference]: Start difference. First operand 345 states and 389 transitions. Second operand 4 states. [2018-02-04 18:34:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:23,695 INFO L93 Difference]: Finished difference Result 347 states and 393 transitions. [2018-02-04 18:34:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:34:23,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 18:34:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:23,698 INFO L225 Difference]: With dead ends: 347 [2018-02-04 18:34:23,699 INFO L226 Difference]: Without dead ends: 347 [2018-02-04 18:34:23,699 INFO L554 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-02-04 18:34:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-04 18:34:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-02-04 18:34:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 18:34:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 387 transitions. [2018-02-04 18:34:23,721 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 387 transitions. Word has length 8 [2018-02-04 18:34:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:23,721 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 387 transitions. [2018-02-04 18:34:23,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:34:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 387 transitions. [2018-02-04 18:34:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:34:23,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:23,722 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:23,722 INFO L371 AbstractCegarLoop]: === Iteration 3 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:23,723 INFO L82 PathProgramCache]: Analyzing trace with hash 543788340, now seen corresponding path program 1 times [2018-02-04 18:34:23,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:23,723 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:23,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:23,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:23,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:23,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:23,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:23,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:34:23,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:34:23,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:34:23,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:34:23,778 INFO L87 Difference]: Start difference. First operand 343 states and 387 transitions. Second operand 4 states. [2018-02-04 18:34:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:24,024 INFO L93 Difference]: Finished difference Result 338 states and 382 transitions. [2018-02-04 18:34:24,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:34:24,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 18:34:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:24,026 INFO L225 Difference]: With dead ends: 338 [2018-02-04 18:34:24,026 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 18:34:24,026 INFO L554 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-02-04 18:34:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 18:34:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-02-04 18:34:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 18:34:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 382 transitions. [2018-02-04 18:34:24,038 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 382 transitions. Word has length 18 [2018-02-04 18:34:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:24,038 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 382 transitions. [2018-02-04 18:34:24,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:34:24,038 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 382 transitions. [2018-02-04 18:34:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:34:24,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:24,039 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:24,039 INFO L371 AbstractCegarLoop]: === Iteration 4 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash 543788341, now seen corresponding path program 1 times [2018-02-04 18:34:24,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:24,039 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:24,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:24,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:24,040 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:24,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:24,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:24,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:34:24,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:34:24,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:34:24,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:34:24,092 INFO L87 Difference]: Start difference. First operand 338 states and 382 transitions. Second operand 4 states. [2018-02-04 18:34:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:24,271 INFO L93 Difference]: Finished difference Result 333 states and 377 transitions. [2018-02-04 18:34:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:34:24,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 18:34:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:24,273 INFO L225 Difference]: With dead ends: 333 [2018-02-04 18:34:24,273 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 18:34:24,273 INFO L554 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-02-04 18:34:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 18:34:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-02-04 18:34:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 18:34:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2018-02-04 18:34:24,283 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 18 [2018-02-04 18:34:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:24,283 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2018-02-04 18:34:24,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:34:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2018-02-04 18:34:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:34:24,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:24,284 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:24,284 INFO L371 AbstractCegarLoop]: === Iteration 5 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash -322430221, now seen corresponding path program 1 times [2018-02-04 18:34:24,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:24,285 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:24,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:24,286 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:24,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:24,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:24,306 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:24,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:24,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:24,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:24,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:24,379 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-02-04 18:34:24,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:24,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:24,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:34:24,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:24,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:24,413 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-02-04 18:34:24,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:24,418 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-02-04 18:34:24,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 18:34:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:24,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:24,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:34:24,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:34:24,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:34:24,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:34:24,433 INFO L87 Difference]: Start difference. First operand 333 states and 377 transitions. Second operand 7 states. [2018-02-04 18:34:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:24,931 INFO L93 Difference]: Finished difference Result 365 states and 410 transitions. [2018-02-04 18:34:24,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:34:24,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 18:34:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:24,933 INFO L225 Difference]: With dead ends: 365 [2018-02-04 18:34:24,934 INFO L226 Difference]: Without dead ends: 365 [2018-02-04 18:34:24,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:34:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-04 18:34:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 325. [2018-02-04 18:34:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 18:34:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 369 transitions. [2018-02-04 18:34:24,942 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 369 transitions. Word has length 19 [2018-02-04 18:34:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:24,942 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 369 transitions. [2018-02-04 18:34:24,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:34:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 369 transitions. [2018-02-04 18:34:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:34:24,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:24,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:24,943 INFO L371 AbstractCegarLoop]: === Iteration 6 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -322430220, now seen corresponding path program 1 times [2018-02-04 18:34:24,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:24,944 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:24,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:24,945 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:24,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:24,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:24,960 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:24,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:24,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:24,961 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:24,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:25,001 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-02-04 18:34:25,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:25,010 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-02-04 18:34:25,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:25,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:25,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:34:25,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:25,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:25,090 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-02-04 18:34:25,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:25,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:25,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:25,103 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-02-04 18:34:25,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:25,113 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-02-04 18:34:25,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-02-04 18:34:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:25,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:25,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:34:25,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:34:25,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:34:25,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:34:25,132 INFO L87 Difference]: Start difference. First operand 325 states and 369 transitions. Second operand 8 states. [2018-02-04 18:34:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:25,964 INFO L93 Difference]: Finished difference Result 356 states and 401 transitions. [2018-02-04 18:34:25,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:34:25,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 18:34:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:25,966 INFO L225 Difference]: With dead ends: 356 [2018-02-04 18:34:25,966 INFO L226 Difference]: Without dead ends: 356 [2018-02-04 18:34:25,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-04 18:34:25,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-04 18:34:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 317. [2018-02-04 18:34:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-04 18:34:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 360 transitions. [2018-02-04 18:34:25,975 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 360 transitions. Word has length 19 [2018-02-04 18:34:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:25,975 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 360 transitions. [2018-02-04 18:34:25,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:34:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 360 transitions. [2018-02-04 18:34:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:34:25,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:25,976 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:25,976 INFO L371 AbstractCegarLoop]: === Iteration 7 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash 241232367, now seen corresponding path program 1 times [2018-02-04 18:34:25,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:25,977 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:25,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:25,977 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:25,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:25,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:25,996 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:25,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:25,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:25,997 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:26,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:26,056 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-02-04 18:34:26,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:34:26,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:34:26,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:34:26,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:34:26,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:34:26,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,093 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 18:34:26,106 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 21 treesize of output 16 [2018-02-04 18:34:26,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:26,110 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 16 treesize of output 23 [2018-02-04 18:34:26,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,125 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 21 treesize of output 16 [2018-02-04 18:34:26,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:26,128 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 16 treesize of output 23 [2018-02-04 18:34:26,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-02-04 18:34:26,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:26,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:26,191 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-02-04 18:34:26,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,200 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-02-04 18:34:26,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:46 [2018-02-04 18:34:26,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 18:34:26,243 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-02-04 18:34:26,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 18:34:26,268 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-02-04 18:34:26,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:26,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2018-02-04 18:34:26,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 18:34:26,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:26,325 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:26,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 18:34:26,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 18:34:26,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:26,357 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:26,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 18:34:26,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:26,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-02-04 18:34:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:26,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:26,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 18:34:26,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:34:26,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:34:26,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:34:26,394 INFO L87 Difference]: Start difference. First operand 317 states and 360 transitions. Second operand 13 states. [2018-02-04 18:34:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:27,083 INFO L93 Difference]: Finished difference Result 340 states and 386 transitions. [2018-02-04 18:34:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:34:27,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 18:34:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:27,084 INFO L225 Difference]: With dead ends: 340 [2018-02-04 18:34:27,084 INFO L226 Difference]: Without dead ends: 340 [2018-02-04 18:34:27,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:34:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-04 18:34:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 328. [2018-02-04 18:34:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 18:34:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 373 transitions. [2018-02-04 18:34:27,090 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 373 transitions. Word has length 28 [2018-02-04 18:34:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:27,090 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 373 transitions. [2018-02-04 18:34:27,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:34:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 373 transitions. [2018-02-04 18:34:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:34:27,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:27,090 INFO L351 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-02-04 18:34:27,090 INFO L371 AbstractCegarLoop]: === Iteration 8 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2037617902, now seen corresponding path program 1 times [2018-02-04 18:34:27,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:27,091 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:27,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:27,091 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:27,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:27,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:27,109 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:27,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:27,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:27,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:27,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:27,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:34:27,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:34:27,166 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-02-04 18:34:27,167 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-02-04 18:34:27,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,176 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-02-04 18:34:27,177 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-02-04 18:34:27,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-04 18:34:27,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:27,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:27,212 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-02-04 18:34:27,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,217 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-02-04 18:34:27,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:29 [2018-02-04 18:34:27,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 18:34:27,275 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-02-04 18:34:27,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-04 18:34:27,302 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-02-04 18:34:27,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:27,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:27,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:25 [2018-02-04 18:34:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:27,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:34:27,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 18:34:27,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:34:27,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:34:27,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:34:27,402 INFO L87 Difference]: Start difference. First operand 328 states and 373 transitions. Second operand 13 states. [2018-02-04 18:34:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:28,040 INFO L93 Difference]: Finished difference Result 333 states and 378 transitions. [2018-02-04 18:34:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:34:28,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-04 18:34:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:28,041 INFO L225 Difference]: With dead ends: 333 [2018-02-04 18:34:28,041 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 18:34:28,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-02-04 18:34:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 18:34:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2018-02-04 18:34:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 18:34:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 376 transitions. [2018-02-04 18:34:28,047 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 376 transitions. Word has length 30 [2018-02-04 18:34:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:28,048 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 376 transitions. [2018-02-04 18:34:28,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:34:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 376 transitions. [2018-02-04 18:34:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 18:34:28,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:28,049 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-04 18:34:28,049 INFO L371 AbstractCegarLoop]: === Iteration 9 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1742025584, now seen corresponding path program 1 times [2018-02-04 18:34:28,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:28,050 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:28,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:28,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:28,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:28,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:28,084 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:28,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:28,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:28,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:28,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:28,187 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-02-04 18:34:28,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:34:28,255 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-02-04 18:34:28,257 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-02-04 18:34:28,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:28,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-04 18:34:28,308 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-02-04 18:34:28,317 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-02-04 18:34:28,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:34:28,344 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 20 treesize of output 19 [2018-02-04 18:34:28,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:34:28,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:34:28,372 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:79 [2018-02-04 18:34:28,469 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 75 treesize of output 72 [2018-02-04 18:34:28,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,474 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 68 treesize of output 83 [2018-02-04 18:34:28,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,540 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 61 [2018-02-04 18:34:28,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:34:28,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:34:28,663 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 42 treesize of output 37 [2018-02-04 18:34:28,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,665 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-02-04 18:34:28,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,673 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 18:34:28,701 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:118, output treesize:144 [2018-02-04 18:34:28,748 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:34:28,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,775 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 29 treesize of output 33 [2018-02-04 18:34:28,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:28,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:168, output treesize:66 [2018-02-04 18:34:28,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:28,871 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-02-04 18:34:28,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,883 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-02-04 18:34:28,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-02-04 18:34:28,972 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-02-04 18:34:28,977 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-02-04 18:34:28,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:28,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,013 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-02-04 18:34:29,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:85 [2018-02-04 18:34:29,105 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-02-04 18:34:29,107 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-02-04 18:34:29,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,128 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-02-04 18:34:29,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:101, output treesize:88 [2018-02-04 18:34:29,162 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-02-04 18:34:29,166 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-02-04 18:34:29,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,194 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-02-04 18:34:29,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:101, output treesize:97 [2018-02-04 18:34:29,248 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-02-04 18:34:29,250 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:29,251 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-02-04 18:34:29,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,267 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-02-04 18:34:29,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:29,284 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-02-04 18:34:29,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:29,298 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-02-04 18:34:29,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:106, output treesize:28 [2018-02-04 18:34:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:29,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:34:29,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:34:29,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:34:29,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:34:29,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:34:29,330 INFO L87 Difference]: Start difference. First operand 331 states and 376 transitions. Second operand 20 states. [2018-02-04 18:34:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:33,436 INFO L93 Difference]: Finished difference Result 476 states and 580 transitions. [2018-02-04 18:34:33,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 18:34:33,436 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-02-04 18:34:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:33,439 INFO L225 Difference]: With dead ends: 476 [2018-02-04 18:34:33,439 INFO L226 Difference]: Without dead ends: 476 [2018-02-04 18:34:33,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 18:34:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-04 18:34:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 379. [2018-02-04 18:34:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 18:34:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 477 transitions. [2018-02-04 18:34:33,449 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 477 transitions. Word has length 47 [2018-02-04 18:34:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:33,450 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 477 transitions. [2018-02-04 18:34:33,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:34:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 477 transitions. [2018-02-04 18:34:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 18:34:33,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:33,451 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-04 18:34:33,451 INFO L371 AbstractCegarLoop]: === Iteration 10 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1742025585, now seen corresponding path program 1 times [2018-02-04 18:34:33,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:33,451 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:33,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:33,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:33,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:33,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:33,477 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:33,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:33,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:33,478 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:33,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:33,536 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-02-04 18:34:33,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,541 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-02-04 18:34:33,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:34:33,706 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-02-04 18:34:33,708 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-02-04 18:34:33,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,723 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-02-04 18:34:33,725 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-02-04 18:34:33,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,738 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 1 xjuncts. [2018-02-04 18:34:33,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-02-04 18:34:33,771 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 53 [2018-02-04 18:34:33,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:33,775 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:33,775 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 33 treesize of output 63 [2018-02-04 18:34:33,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,790 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 26 treesize of output 25 [2018-02-04 18:34:33,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,823 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 38 treesize of output 48 [2018-02-04 18:34:33,826 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 39 treesize of output 38 [2018-02-04 18:34:33,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,858 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 1 xjuncts. [2018-02-04 18:34:33,858 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:79, output treesize:77 [2018-02-04 18:34:33,900 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 142 treesize of output 140 [2018-02-04 18:34:33,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:33,904 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 135 treesize of output 162 [2018-02-04 18:34:33,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:33,976 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 149 treesize of output 138 [2018-02-04 18:34:33,980 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:33,980 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 142 treesize of output 169 [2018-02-04 18:34:33,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,042 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 147 [2018-02-04 18:34:34,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:34:34,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:34:34,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:34:34,129 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:188, output treesize:269 [2018-02-04 18:34:34,199 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:34:34,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,247 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 18 treesize of output 33 [2018-02-04 18:34:34,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,296 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 29 treesize of output 33 [2018-02-04 18:34:34,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:34,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:288, output treesize:154 [2018-02-04 18:34:34,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 79 [2018-02-04 18:34:34,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,451 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 22 treesize of output 25 [2018-02-04 18:34:34,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,469 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-02-04 18:34:34,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:165, output treesize:153 [2018-02-04 18:34:34,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,553 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 140 treesize of output 148 [2018-02-04 18:34:34,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 12 treesize of output 1 [2018-02-04 18:34:34,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,593 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 149 [2018-02-04 18:34:34,595 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-02-04 18:34:34,595 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,620 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 1 xjuncts. [2018-02-04 18:34:34,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:186, output treesize:156 [2018-02-04 18:34:34,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,739 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 144 treesize of output 152 [2018-02-04 18:34:34,741 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 16 treesize of output 15 [2018-02-04 18:34:34,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 147 [2018-02-04 18:34:34,789 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-02-04 18:34:34,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:34,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:188, output treesize:171 [2018-02-04 18:34:34,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,884 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 153 treesize of output 159 [2018-02-04 18:34:34,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,888 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 24 treesize of output 33 [2018-02-04 18:34:34,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:34,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 147 [2018-02-04 18:34:34,951 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-02-04 18:34:34,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:34,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:35,001 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:204, output treesize:196 [2018-02-04 18:34:35,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:35,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:35,071 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 158 treesize of output 143 [2018-02-04 18:34:35,074 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:35,075 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 99 treesize of output 95 [2018-02-04 18:34:35,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:35,106 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 27 treesize of output 20 [2018-02-04 18:34:35,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:35,131 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 87 treesize of output 61 [2018-02-04 18:34:35,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:35,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:35,182 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-02-04 18:34:35,203 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:35,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2018-02-04 18:34:35,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,250 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-02-04 18:34:35,251 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:35,260 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-02-04 18:34:35,260 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:35,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:35,281 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:214, output treesize:35 [2018-02-04 18:34:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:35,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:34:35,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 18:34:35,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 18:34:35,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 18:34:35,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:34:35,349 INFO L87 Difference]: Start difference. First operand 379 states and 477 transitions. Second operand 23 states. [2018-02-04 18:34:37,333 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 132 DAG size of output 92 [2018-02-04 18:34:37,570 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 145 DAG size of output 99 [2018-02-04 18:34:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:42,399 INFO L93 Difference]: Finished difference Result 475 states and 579 transitions. [2018-02-04 18:34:42,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:34:42,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2018-02-04 18:34:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:42,400 INFO L225 Difference]: With dead ends: 475 [2018-02-04 18:34:42,401 INFO L226 Difference]: Without dead ends: 475 [2018-02-04 18:34:42,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=267, Invalid=1455, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 18:34:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-04 18:34:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 379. [2018-02-04 18:34:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-04 18:34:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 476 transitions. [2018-02-04 18:34:42,413 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 476 transitions. Word has length 47 [2018-02-04 18:34:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:42,414 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 476 transitions. [2018-02-04 18:34:42,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 18:34:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 476 transitions. [2018-02-04 18:34:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 18:34:42,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:42,415 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-02-04 18:34:42,415 INFO L371 AbstractCegarLoop]: === Iteration 11 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:42,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1722140858, now seen corresponding path program 1 times [2018-02-04 18:34:42,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:42,415 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:42,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:42,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:42,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:42,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:42,463 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:42,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:42,463 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:42,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:42,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:42,627 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-02-04 18:34:42,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 18:34:42,678 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-02-04 18:34:42,679 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-02-04 18:34:42,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 18:34:42,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:42,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:42,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:42,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2018-02-04 18:34:42,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:42 [2018-02-04 18:34:42,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 18:34:42,826 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-02-04 18:34:42,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-02-04 18:34:42,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 18:34:42,852 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-02-04 18:34:42,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:42 [2018-02-04 18:34:42,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 18:34:42,889 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-02-04 18:34:42,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,935 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-02-04 18:34:42,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2018-02-04 18:34:42,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-02-04 18:34:42,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 18:34:42,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:42,989 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-02-04 18:34:42,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:43,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:43,011 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:24 [2018-02-04 18:34:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 18:34:43,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:34:43,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 18:34:43,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:34:43,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:34:43,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:34:43,045 INFO L87 Difference]: Start difference. First operand 379 states and 476 transitions. Second operand 19 states. [2018-02-04 18:34:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:44,443 INFO L93 Difference]: Finished difference Result 442 states and 545 transitions. [2018-02-04 18:34:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:34:44,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-04 18:34:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:44,445 INFO L225 Difference]: With dead ends: 442 [2018-02-04 18:34:44,445 INFO L226 Difference]: Without dead ends: 442 [2018-02-04 18:34:44,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:34:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-04 18:34:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 381. [2018-02-04 18:34:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-04 18:34:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 477 transitions. [2018-02-04 18:34:44,456 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 477 transitions. Word has length 66 [2018-02-04 18:34:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:44,456 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 477 transitions. [2018-02-04 18:34:44,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:34:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 477 transitions. [2018-02-04 18:34:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 18:34:44,458 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:44,458 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-02-04 18:34:44,458 INFO L371 AbstractCegarLoop]: === Iteration 12 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1722140857, now seen corresponding path program 1 times [2018-02-04 18:34:44,458 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:44,458 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:44,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:44,459 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:44,459 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:44,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:44,500 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:44,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:44,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:44,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:44,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:44,734 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-02-04 18:34:44,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-02-04 18:34:44,843 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-02-04 18:34:44,844 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-02-04 18:34:44,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,869 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-02-04 18:34:44,871 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-02-04 18:34:44,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:58 [2018-02-04 18:34:44,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:44,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:44,911 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:44,912 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:44,913 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 29 treesize of output 38 [2018-02-04 18:34:44,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:59 [2018-02-04 18:34:44,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:44,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:44,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:44,986 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 22 treesize of output 25 [2018-02-04 18:34:44,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:44,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-04 18:34:44,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,009 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-02-04 18:34:45,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:68 [2018-02-04 18:34:45,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-02-04 18:34:45,054 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-02-04 18:34:45,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-02-04 18:34:45,074 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-02-04 18:34:45,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,089 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 1 xjuncts. [2018-02-04 18:34:45,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:68 [2018-02-04 18:34:45,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 18:34:45,173 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 16 treesize of output 15 [2018-02-04 18:34:45,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 18:34:45,200 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-02-04 18:34:45,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:45,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:86 [2018-02-04 18:34:45,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-02-04 18:34:45,274 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 21 [2018-02-04 18:34:45,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-04 18:34:45,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:34:45,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:45,318 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:95 [2018-02-04 18:34:45,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-02-04 18:34:45,353 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 1 [2018-02-04 18:34:45,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,360 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:45,360 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-02-04 18:34:45,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,386 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 0 case distinctions, treesize of input 35 treesize of output 31 [2018-02-04 18:34:45,396 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:34:45,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 18:34:45,397 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:45,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:45,408 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:113, output treesize:21 [2018-02-04 18:34:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:34:45,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:34:45,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 18:34:45,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 18:34:45,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 18:34:45,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-02-04 18:34:45,442 INFO L87 Difference]: Start difference. First operand 381 states and 477 transitions. Second operand 24 states. [2018-02-04 18:34:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:49,291 INFO L93 Difference]: Finished difference Result 476 states and 579 transitions. [2018-02-04 18:34:49,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:34:49,292 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-02-04 18:34:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:49,293 INFO L225 Difference]: With dead ends: 476 [2018-02-04 18:34:49,293 INFO L226 Difference]: Without dead ends: 476 [2018-02-04 18:34:49,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=355, Invalid=1715, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 18:34:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-04 18:34:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 330. [2018-02-04 18:34:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 18:34:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 389 transitions. [2018-02-04 18:34:49,301 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 389 transitions. Word has length 66 [2018-02-04 18:34:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:49,301 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 389 transitions. [2018-02-04 18:34:49,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 18:34:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 389 transitions. [2018-02-04 18:34:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-04 18:34:49,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:49,305 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:49,306 INFO L371 AbstractCegarLoop]: === Iteration 13 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1012855197, now seen corresponding path program 1 times [2018-02-04 18:34:49,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:49,306 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:49,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:49,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:49,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:49,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2018-02-04 18:34:49,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:49,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:49,430 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:49,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2018-02-04 18:34:49,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:34:49,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-02-04 18:34:49,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:34:49,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:34:49,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:34:49,505 INFO L87 Difference]: Start difference. First operand 330 states and 389 transitions. Second operand 3 states. [2018-02-04 18:34:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:34:49,512 INFO L93 Difference]: Finished difference Result 331 states and 390 transitions. [2018-02-04 18:34:49,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:34:49,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-02-04 18:34:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:34:49,514 INFO L225 Difference]: With dead ends: 331 [2018-02-04 18:34:49,514 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 18:34:49,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 256 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-02-04 18:34:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 18:34:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-02-04 18:34:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 18:34:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 390 transitions. [2018-02-04 18:34:49,521 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 390 transitions. Word has length 255 [2018-02-04 18:34:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:34:49,522 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 390 transitions. [2018-02-04 18:34:49,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:34:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 390 transitions. [2018-02-04 18:34:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-02-04 18:34:49,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:34:49,526 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:34:49,526 INFO L371 AbstractCegarLoop]: === Iteration 14 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:34:49,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1995744797, now seen corresponding path program 1 times [2018-02-04 18:34:49,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:34:49,526 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:34:49,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:49,527 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:49,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:34:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:49,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:34:49,649 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:34:49,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:34:49,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:34:49,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:34:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:34:51,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:34:51,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:34:51,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:34:51,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 18:34:51,144 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 21 treesize of output 16 [2018-02-04 18:34:51,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,146 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 16 treesize of output 23 [2018-02-04 18:34:51,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 18:34:51,183 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 30 treesize of output 40 [2018-02-04 18:34:51,185 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 31 treesize of output 30 [2018-02-04 18:34:51,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,202 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,213 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 4 case distinctions, treesize of input 26 treesize of output 49 [2018-02-04 18:34:51,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 18:34:51,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:34:51,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:34:51,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:48, output treesize:135 [2018-02-04 18:34:51,341 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 74 treesize of output 73 [2018-02-04 18:34:51,344 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,344 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 73 treesize of output 88 [2018-02-04 18:34:51,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 68 [2018-02-04 18:34:51,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:34:51,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:34:51,467 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 43 treesize of output 36 [2018-02-04 18:34:51,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,471 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 23 treesize of output 46 [2018-02-04 18:34:51,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,516 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 43 treesize of output 36 [2018-02-04 18:34:51,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,528 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 23 treesize of output 23 [2018-02-04 18:34:51,528 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,533 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 18:34:51,568 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:161, output treesize:179 [2018-02-04 18:34:51,617 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:34:51,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:34:51,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-02-04 18:34:51,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:34:51,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:51,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:211, output treesize:72 [2018-02-04 18:34:51,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:51,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:51,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:34:51,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:68 [2018-02-04 18:35:10,499 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 69 DAG size of output 58 [2018-02-04 18:35:10,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,508 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 26 treesize of output 50 [2018-02-04 18:35:10,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:35:10,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,619 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 147 [2018-02-04 18:35:10,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:35:10,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:35:10,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2018-02-04 18:35:10,785 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:35:10,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,796 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:35:10,802 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 105 [2018-02-04 18:35:10,878 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,879 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:35:10,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2018-02-04 18:35:10,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:35:10,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,925 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:35:10,925 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 64 treesize of output 65 [2018-02-04 18:35:10,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:35:10,948 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:35:10,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,986 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 75 [2018-02-04 18:35:10,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,990 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-02-04 18:35:10,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:10,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:11,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:35:11,011 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 23 treesize of output 46 [2018-02-04 18:35:11,011 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:35:11,018 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:35:11,032 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:35:11,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:35:11,059 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:35:11,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:35:11,085 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:185, output treesize:106 [2018-02-04 18:35:11,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:35:11,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:35:11,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:35:11,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2018-02-04 18:35:11,516 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-02-04 18:35:11,516 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 9 variables, input treesize:129, output treesize:1 [2018-02-04 18:35:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 1119 proven. 55 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-02-04 18:35:11,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:35:11,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 18:35:11,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:35:11,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:35:11,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1164, Unknown=24, NotChecked=0, Total=1332 [2018-02-04 18:35:11,603 INFO L87 Difference]: Start difference. First operand 331 states and 390 transitions. Second operand 37 states. [2018-02-04 18:35:39,150 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 73 DAG size of output 65 [2018-02-04 18:35:47,655 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 89 DAG size of output 79 [2018-02-04 18:36:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:36:07,154 INFO L93 Difference]: Finished difference Result 543 states and 673 transitions. [2018-02-04 18:36:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:36:07,155 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 283 [2018-02-04 18:36:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:36:07,156 INFO L225 Difference]: With dead ends: 543 [2018-02-04 18:36:07,156 INFO L226 Difference]: Without dead ends: 543 [2018-02-04 18:36:07,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=363, Invalid=2669, Unknown=48, NotChecked=0, Total=3080 [2018-02-04 18:36:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-02-04 18:36:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 391. [2018-02-04 18:36:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-04 18:36:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 507 transitions. [2018-02-04 18:36:07,164 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 507 transitions. Word has length 283 [2018-02-04 18:36:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:36:07,165 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 507 transitions. [2018-02-04 18:36:07,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:36:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 507 transitions. [2018-02-04 18:36:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-02-04 18:36:07,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:36:07,168 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:36:07,168 INFO L371 AbstractCegarLoop]: === Iteration 15 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:36:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1251040265, now seen corresponding path program 1 times [2018-02-04 18:36:07,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:36:07,168 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:36:07,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:07,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:36:07,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:36:07,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:36:07,272 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:36:07,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:36:07,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:36:07,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:36:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:36:09,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:36:09,430 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-02-04 18:36:09,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:36:09,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,435 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-02-04 18:36:09,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,462 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-02-04 18:36:09,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-02-04 18:36:09,496 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc52.base| Int)) (and (not (= |append_#t~malloc52.base| 0)) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc52.base| 1)))) is different from true [2018-02-04 18:36:09,502 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,503 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 17 treesize of output 30 [2018-02-04 18:36:09,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,510 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-02-04 18:36:09,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,525 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 17 treesize of output 30 [2018-02-04 18:36:09,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,567 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-02-04 18:36:09,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,579 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 17 treesize of output 30 [2018-02-04 18:36:09,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,586 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-02-04 18:36:09,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,606 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 17 treesize of output 30 [2018-02-04 18:36:09,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,613 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-02-04 18:36:09,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,627 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 17 treesize of output 30 [2018-02-04 18:36:09,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,633 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-02-04 18:36:09,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,649 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 17 treesize of output 30 [2018-02-04 18:36:09,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,658 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-02-04 18:36:09,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,674 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 17 treesize of output 30 [2018-02-04 18:36:09,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,683 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-02-04 18:36:09,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,695 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 17 treesize of output 30 [2018-02-04 18:36:09,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,701 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-02-04 18:36:09,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-02-04 18:36:09,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,727 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-02-04 18:36:09,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:09,744 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 17 treesize of output 30 [2018-02-04 18:36:09,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,754 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-02-04 18:36:09,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:09,820 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-02-04 18:36:09,821 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-02-04 18:36:09,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:09,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-02-04 18:36:09,876 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-02-04 18:36:09,883 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-02-04 18:36:09,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:36:09,901 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 20 treesize of output 19 [2018-02-04 18:36:09,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:09,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:36:09,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:36:09,926 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:86 [2018-02-04 18:36:09,995 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 63 treesize of output 62 [2018-02-04 18:36:09,998 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 56 treesize of output 63 [2018-02-04 18:36:09,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:10,044 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 36 treesize of output 45 [2018-02-04 18:36:10,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:36:10,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:36:10,095 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 39 treesize of output 34 [2018-02-04 18:36:10,097 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 15 [2018-02-04 18:36:10,097 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:10,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:10,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:36:10,139 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:103, output treesize:124 [2018-02-04 18:36:10,184 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:36:10,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:10,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:10,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:10,209 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 17 treesize of output 30 [2018-02-04 18:36:10,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:10,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:10,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:161, output treesize:56 [2018-02-04 18:36:10,386 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:10,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:10,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:10,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:29 [2018-02-04 18:36:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 519 proven. 15 refuted. 0 times theorem prover too weak. 634 trivial. 232 not checked. [2018-02-04 18:36:10,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:36:10,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 18:36:10,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:36:10,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:36:10,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=535, Unknown=2, NotChecked=46, Total=650 [2018-02-04 18:36:10,694 INFO L87 Difference]: Start difference. First operand 391 states and 507 transitions. Second operand 26 states. [2018-02-04 18:36:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:36:20,288 INFO L93 Difference]: Finished difference Result 454 states and 541 transitions. [2018-02-04 18:36:20,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 18:36:20,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 293 [2018-02-04 18:36:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:36:20,290 INFO L225 Difference]: With dead ends: 454 [2018-02-04 18:36:20,290 INFO L226 Difference]: Without dead ends: 454 [2018-02-04 18:36:20,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 258 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=259, Invalid=1607, Unknown=30, NotChecked=84, Total=1980 [2018-02-04 18:36:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-02-04 18:36:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 361. [2018-02-04 18:36:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-04 18:36:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 441 transitions. [2018-02-04 18:36:20,299 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 441 transitions. Word has length 293 [2018-02-04 18:36:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:36:20,299 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 441 transitions. [2018-02-04 18:36:20,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:36:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 441 transitions. [2018-02-04 18:36:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 18:36:20,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:36:20,302 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:36:20,302 INFO L371 AbstractCegarLoop]: === Iteration 16 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:36:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -72385807, now seen corresponding path program 2 times [2018-02-04 18:36:20,302 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:36:20,302 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:36:20,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:20,303 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:36:20,303 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:36:20,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:36:20,480 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:36:20,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:36:20,480 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:36:20,481 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:36:22,076 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:36:22,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:36:22,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:36:22,111 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 5 treesize of output 1 [2018-02-04 18:36:22,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-02-04 18:36:22,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:36:22,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:36:22,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-04 18:36:22,243 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 21 treesize of output 16 [2018-02-04 18:36:22,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,246 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 16 treesize of output 23 [2018-02-04 18:36:22,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:22,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-04 18:36:22,286 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 30 treesize of output 40 [2018-02-04 18:36:22,288 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,301 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 4 case distinctions, treesize of input 26 treesize of output 49 [2018-02-04 18:36:22,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:36:22,339 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 27 treesize of output 26 [2018-02-04 18:36:22,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:36:22,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 18:36:22,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:128 [2018-02-04 18:36:22,454 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 83 treesize of output 74 [2018-02-04 18:36:22,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,457 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 72 treesize of output 85 [2018-02-04 18:36:22,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 69 [2018-02-04 18:36:22,511 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:36:22,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:36:22,646 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 51 treesize of output 44 [2018-02-04 18:36:22,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,656 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 25 treesize of output 52 [2018-02-04 18:36:22,656 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,744 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 53 treesize of output 46 [2018-02-04 18:36:22,746 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,748 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 25 treesize of output 27 [2018-02-04 18:36:22,748 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,757 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 18:36:22,813 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:188, output treesize:206 [2018-02-04 18:36:22,895 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:36:22,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,933 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 29 treesize of output 31 [2018-02-04 18:36:22,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:22,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:22,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:250, output treesize:73 [2018-02-04 18:36:22,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,986 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-02-04 18:36:22,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:22,989 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-02-04 18:36:22,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:23,005 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:23,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:23,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-02-04 18:36:23,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:23,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:23,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:23,017 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:80, output treesize:15 [2018-02-04 18:36:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 378 proven. 13 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2018-02-04 18:36:23,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:36:23,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 18:36:23,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:36:23,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:36:23,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:36:23,135 INFO L87 Difference]: Start difference. First operand 361 states and 441 transitions. Second operand 20 states. [2018-02-04 18:36:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:36:25,969 INFO L93 Difference]: Finished difference Result 443 states and 530 transitions. [2018-02-04 18:36:25,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 18:36:25,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 297 [2018-02-04 18:36:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:36:25,970 INFO L225 Difference]: With dead ends: 443 [2018-02-04 18:36:25,971 INFO L226 Difference]: Without dead ends: 443 [2018-02-04 18:36:25,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 18:36:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-04 18:36:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 396. [2018-02-04 18:36:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-04 18:36:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 494 transitions. [2018-02-04 18:36:25,979 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 494 transitions. Word has length 297 [2018-02-04 18:36:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:36:25,980 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 494 transitions. [2018-02-04 18:36:25,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:36:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 494 transitions. [2018-02-04 18:36:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 18:36:25,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:36:25,983 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:36:25,983 INFO L371 AbstractCegarLoop]: === Iteration 17 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:36:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash -72385806, now seen corresponding path program 1 times [2018-02-04 18:36:25,983 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:36:25,983 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:36:25,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:25,984 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:36:25,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:36:26,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:36:26,141 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:36:26,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:36:26,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:36:26,142 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:36:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:36:27,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:36:27,616 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-02-04 18:36:27,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:36:27,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,624 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-02-04 18:36:27,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,645 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-02-04 18:36:27,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-02-04 18:36:27,670 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|append_#t~malloc52.base| Int)) (and (not (= |append_#t~malloc52.base| 0)) (= |c_#valid| (store |c_old(#valid)| |append_#t~malloc52.base| 1)))) is different from true [2018-02-04 18:36:27,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,676 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 17 treesize of output 30 [2018-02-04 18:36:27,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,682 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-02-04 18:36:27,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:27,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,695 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 17 treesize of output 30 [2018-02-04 18:36:27,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,704 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-02-04 18:36:27,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:27,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,737 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 17 treesize of output 30 [2018-02-04 18:36:27,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,744 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-02-04 18:36:27,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-02-04 18:36:27,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,758 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 17 treesize of output 30 [2018-02-04 18:36:27,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,772 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-02-04 18:36:27,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:27,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,803 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 17 treesize of output 30 [2018-02-04 18:36:27,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,811 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-02-04 18:36:27,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-02-04 18:36:27,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,823 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 17 treesize of output 30 [2018-02-04 18:36:27,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,877 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-02-04 18:36:27,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:27,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,887 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 17 treesize of output 30 [2018-02-04 18:36:27,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,893 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-02-04 18:36:27,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:27,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,905 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 17 treesize of output 30 [2018-02-04 18:36:27,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,911 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-02-04 18:36:27,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:27,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,924 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 17 treesize of output 30 [2018-02-04 18:36:27,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,932 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-02-04 18:36:27,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:27,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:27,948 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 17 treesize of output 30 [2018-02-04 18:36:27,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:27,967 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-02-04 18:36:27,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:28,024 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,026 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 17 treesize of output 30 [2018-02-04 18:36:28,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,034 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-02-04 18:36:28,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:19 [2018-02-04 18:36:28,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,052 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 17 treesize of output 30 [2018-02-04 18:36:28,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,058 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-02-04 18:36:28,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-02-04 18:36:28,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:36:28,139 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 8 treesize of output 7 [2018-02-04 18:36:28,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 18:36:28,174 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-02-04 18:36:28,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 18:36:28,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,194 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 21 treesize of output 16 [2018-02-04 18:36:28,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,199 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 16 treesize of output 23 [2018-02-04 18:36:28,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-02-04 18:36:28,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 53 [2018-02-04 18:36:28,284 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 36 treesize of output 35 [2018-02-04 18:36:28,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2018-02-04 18:36:28,329 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 46 treesize of output 45 [2018-02-04 18:36:28,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,360 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 4 case distinctions, treesize of input 39 treesize of output 62 [2018-02-04 18:36:28,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 18:36:28,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:36:28,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:36:28,418 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:75, output treesize:201 [2018-02-04 18:36:28,553 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-02-04 18:36:28,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-02-04 18:36:28,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 42 [2018-02-04 18:36:28,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-02-04 18:36:28,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,696 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 16 treesize of output 23 [2018-02-04 18:36:28,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,794 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:28,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2018-02-04 18:36:28,796 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:28,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-02-04 18:36:28,797 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,807 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:28,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-02-04 18:36:28,872 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:28,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-04 18:36:28,873 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,882 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:28,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 137 [2018-02-04 18:36:28,955 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 122 treesize of output 127 [2018-02-04 18:36:28,955 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:29,025 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:29,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 104 [2018-02-04 18:36:29,098 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 108 treesize of output 113 [2018-02-04 18:36:29,099 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:29,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:29,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:29,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 104 [2018-02-04 18:36:29,168 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 18:36:29,227 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:36:29,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 18:36:29,336 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:273, output treesize:298 [2018-02-04 18:36:29,451 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:36:29,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:29,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:29,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:29,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:29,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:29,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 63 [2018-02-04 18:36:29,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:29,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:29,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:350, output treesize:101 [2018-02-04 18:36:29,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:29,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:29,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:29,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:29,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:29,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:62 [2018-02-04 18:36:30,385 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 104 DAG size of output 72 [2018-02-04 18:36:30,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2018-02-04 18:36:30,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,470 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:30,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 184 [2018-02-04 18:36:30,564 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 18 treesize of output 21 [2018-02-04 18:36:30,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-02-04 18:36:30,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,582 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 23 treesize of output 46 [2018-02-04 18:36:30,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,599 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,633 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:30,641 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 157 [2018-02-04 18:36:30,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 52 [2018-02-04 18:36:30,655 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-04 18:36:30,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 140 [2018-02-04 18:36:30,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,718 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:30,719 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2018-02-04 18:36:30,719 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,738 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,745 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 138 [2018-02-04 18:36:30,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,751 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:30,751 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 107 [2018-02-04 18:36:30,752 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,773 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 138 [2018-02-04 18:36:30,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:30,790 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:30,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 107 [2018-02-04 18:36:30,792 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,816 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:30,881 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:36:30,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:36:31,019 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 0 case distinctions, treesize of input 126 treesize of output 112 [2018-02-04 18:36:31,022 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-02-04 18:36:31,022 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:31,034 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:31,037 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 0 case distinctions, treesize of input 120 treesize of output 106 [2018-02-04 18:36:31,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-02-04 18:36:31,039 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:31,050 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:31,053 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 0 case distinctions, treesize of input 120 treesize of output 106 [2018-02-04 18:36:31,055 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-02-04 18:36:31,055 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:31,067 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:31,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-02-04 18:36:31,138 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 9 variables, input treesize:328, output treesize:369 [2018-02-04 18:36:31,312 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 79 DAG size of output 78 [2018-02-04 18:36:31,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:31,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:31,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:36:31,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-02-04 18:36:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 116 proven. 129 refuted. 20 times theorem prover too weak. 551 trivial. 570 not checked. [2018-02-04 18:36:31,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:36:31,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-04 18:36:31,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 18:36:31,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 18:36:31,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1658, Unknown=64, NotChecked=84, Total=1980 [2018-02-04 18:36:31,993 INFO L87 Difference]: Start difference. First operand 396 states and 494 transitions. Second operand 45 states. [2018-02-04 18:36:35,384 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 83 DAG size of output 67 [2018-02-04 18:36:39,738 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 102 DAG size of output 80 [2018-02-04 18:36:48,931 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-02-04 18:36:49,198 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 85 DAG size of output 81 [2018-02-04 18:36:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:36:57,401 INFO L93 Difference]: Finished difference Result 604 states and 739 transitions. [2018-02-04 18:36:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 18:36:57,401 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 297 [2018-02-04 18:36:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:36:57,403 INFO L225 Difference]: With dead ends: 604 [2018-02-04 18:36:57,403 INFO L226 Difference]: Without dead ends: 604 [2018-02-04 18:36:57,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 240 SyntacticMatches, 13 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=547, Invalid=4321, Unknown=248, NotChecked=140, Total=5256 [2018-02-04 18:36:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-02-04 18:36:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 436. [2018-02-04 18:36:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-04 18:36:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 569 transitions. [2018-02-04 18:36:57,415 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 569 transitions. Word has length 297 [2018-02-04 18:36:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:36:57,416 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 569 transitions. [2018-02-04 18:36:57,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 18:36:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 569 transitions. [2018-02-04 18:36:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-02-04 18:36:57,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:36:57,420 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:36:57,420 INFO L371 AbstractCegarLoop]: === Iteration 18 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:36:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1338468154, now seen corresponding path program 2 times [2018-02-04 18:36:57,421 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:36:57,421 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:36:57,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:57,422 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:36:57,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:36:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:36:57,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:36:57,512 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:36:57,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:36:57,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:36:57,513 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:36:57,755 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:36:57,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:36:57,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:36:57,791 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-02-04 18:36:57,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 18:36:57,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 18:36:57,812 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-02-04 18:36:57,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-02-04 18:36:57,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:36:57,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:36:57,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,987 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:57,988 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 28 treesize of output 26 [2018-02-04 18:36:57,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:57,990 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 26 treesize of output 26 [2018-02-04 18:36:57,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:57,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2018-02-04 18:36:58,031 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:58,032 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 30 treesize of output 30 [2018-02-04 18:36:58,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,034 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 30 treesize of output 26 [2018-02-04 18:36:58,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,060 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 21 treesize of output 16 [2018-02-04 18:36:58,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,062 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 16 treesize of output 23 [2018-02-04 18:36:58,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,079 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 1 xjuncts. [2018-02-04 18:36:58,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:50 [2018-02-04 18:36:58,114 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 30 treesize of output 58 [2018-02-04 18:36:58,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,119 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:58,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 38 treesize of output 70 [2018-02-04 18:36:58,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,137 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 33 treesize of output 32 [2018-02-04 18:36:58,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,192 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 45 treesize of output 53 [2018-02-04 18:36:58,194 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 46 treesize of output 45 [2018-02-04 18:36:58,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,222 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 39 treesize of output 64 [2018-02-04 18:36:58,222 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 18:36:58,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:36:58,263 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 2 xjuncts. [2018-02-04 18:36:58,263 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:76, output treesize:136 [2018-02-04 18:36:58,359 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 154 treesize of output 149 [2018-02-04 18:36:58,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,363 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 153 treesize of output 180 [2018-02-04 18:36:58,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 136 treesize of output 172 [2018-02-04 18:36:58,460 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:36:58,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:36:58,653 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:58,654 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 79 treesize of output 79 [2018-02-04 18:36:58,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,660 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 32 treesize of output 30 [2018-02-04 18:36:58,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,673 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,755 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:58,755 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 124 treesize of output 112 [2018-02-04 18:36:58,757 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:58,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 167 [2018-02-04 18:36:58,759 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,779 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 150 [2018-02-04 18:36:58,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,803 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:58,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 130 treesize of output 136 [2018-02-04 18:36:58,804 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,861 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 137 treesize of output 164 [2018-02-04 18:36:58,862 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,899 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,953 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 66 treesize of output 59 [2018-02-04 18:36:58,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:58,957 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 25 treesize of output 27 [2018-02-04 18:36:58,957 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:58,966 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:36:59,016 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:234, output treesize:297 [2018-02-04 18:36:59,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 99 [2018-02-04 18:36:59,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,199 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:59,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 75 [2018-02-04 18:36:59,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,221 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 66 treesize of output 60 [2018-02-04 18:36:59,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,240 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:59,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 117 [2018-02-04 18:36:59,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 59 [2018-02-04 18:36:59,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,284 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:59,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2018-02-04 18:36:59,284 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,304 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 25 treesize of output 19 [2018-02-04 18:36:59,304 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,319 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,320 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:59,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:36:59,324 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:36:59,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-02-04 18:36:59,324 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:36:59,342 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:161, output treesize:9 [2018-02-04 18:36:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-02-04 18:36:59,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:36:59,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 18:36:59,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 18:36:59,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 18:36:59,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=379, Unknown=2, NotChecked=0, Total=462 [2018-02-04 18:36:59,434 INFO L87 Difference]: Start difference. First operand 436 states and 569 transitions. Second operand 22 states. [2018-02-04 18:37:12,326 WARN L146 SmtUtils]: Spent 1170ms on a formula simplification. DAG size of input: 64 DAG size of output 64 [2018-02-04 18:37:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:37:22,916 INFO L93 Difference]: Finished difference Result 510 states and 638 transitions. [2018-02-04 18:37:22,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 18:37:22,916 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 303 [2018-02-04 18:37:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:37:22,919 INFO L225 Difference]: With dead ends: 510 [2018-02-04 18:37:22,919 INFO L226 Difference]: Without dead ends: 510 [2018-02-04 18:37:22,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=306, Invalid=1493, Unknown=7, NotChecked=0, Total=1806 [2018-02-04 18:37:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-02-04 18:37:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 436. [2018-02-04 18:37:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-04 18:37:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 558 transitions. [2018-02-04 18:37:22,929 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 558 transitions. Word has length 303 [2018-02-04 18:37:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:37:22,930 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 558 transitions. [2018-02-04 18:37:22,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 18:37:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 558 transitions. [2018-02-04 18:37:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-02-04 18:37:22,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:37:22,934 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:37:22,934 INFO L371 AbstractCegarLoop]: === Iteration 19 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, 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-02-04 18:37:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1479212893, now seen corresponding path program 3 times [2018-02-04 18:37:22,935 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:37:22,935 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:37:22,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:22,935 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:37:22,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:37:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:37:23,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:37:23,212 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:37:23,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:37:23,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:37:23,213 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:37:23,304 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 18:37:23,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:37:23,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:37:23,333 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-02-04 18:37:23,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 18:37:23,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 18:37:23,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:37:23,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-02-04 18:37:23,407 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-02-04 18:37:23,409 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-02-04 18:37:23,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,422 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 21 treesize of output 16 [2018-02-04 18:37:23,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:23,424 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 16 treesize of output 23 [2018-02-04 18:37:23,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-02-04 18:37:23,464 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 30 treesize of output 40 [2018-02-04 18:37:23,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:23,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:23,483 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 26 treesize of output 49 [2018-02-04 18:37:23,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:37:23,516 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 27 treesize of output 26 [2018-02-04 18:37:23,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:37:23,563 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-02-04 18:37:23,565 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-02-04 18:37:23,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:37:23,620 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:68, output treesize:122 [2018-02-04 18:37:23,706 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 100 treesize of output 95 [2018-02-04 18:37:23,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:23,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:23,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 79 [2018-02-04 18:37:23,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:37:23,793 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 89 treesize of output 96 [2018-02-04 18:37:23,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:37:23,929 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:23,929 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 63 treesize of output 61 [2018-02-04 18:37:23,931 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:23,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-02-04 18:37:23,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,942 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:23,990 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 52 treesize of output 45 [2018-02-04 18:37:23,991 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:23,992 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:23,993 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 21 treesize of output 28 [2018-02-04 18:37:23,994 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:24,001 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:24,045 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 59 treesize of output 52 [2018-02-04 18:37:24,048 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:24,049 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:24,049 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 21 treesize of output 36 [2018-02-04 18:37:24,049 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:24,060 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:24,081 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 96 treesize of output 112 [2018-02-04 18:37:24,083 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 95 treesize of output 102 [2018-02-04 18:37:24,084 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:24,136 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:24,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:37:24,168 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:164, output treesize:189 [2018-02-04 18:37:24,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:24,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:24,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:24,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:24,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:37:24,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:95, output treesize:79 [2018-02-04 18:37:29,668 WARN L146 SmtUtils]: Spent 726ms on a formula simplification. DAG size of input: 214 DAG size of output 70 [2018-02-04 18:37:29,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:29,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:29,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:29,678 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 26 treesize of output 46 [2018-02-04 18:37:29,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:29,733 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:29,768 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:29,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 250 treesize of output 214 [2018-02-04 18:37:29,875 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 49 treesize of output 46 [2018-02-04 18:37:29,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:29,931 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:29,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 157 [2018-02-04 18:37:29,938 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-02-04 18:37:29,943 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 31 treesize of output 33 [2018-02-04 18:37:29,944 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:37:29,951 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:37:29,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:29,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:29,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:29,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:29,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:30,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:30,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:30,002 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:30,002 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:37:30,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:30,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 200 [2018-02-04 18:37:30,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:37:30,026 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_arrayElimArr_18 term size 53 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) 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.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) 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:397) 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:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) 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-02-04 18:37:30,030 INFO L168 Benchmark]: Toolchain (without parser) took 188348.00 ms. Allocated memory was 401.6 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 358.3 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 194.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:30,031 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 401.6 MB. Free memory is still 363.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:37:30,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.75 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 345.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:30,031 INFO L168 Benchmark]: Boogie Preprocessor took 36.59 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:30,031 INFO L168 Benchmark]: RCFGBuilder took 784.41 ms. Allocated memory is still 401.6 MB. Free memory was 342.4 MB in the beginning and 269.0 MB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:30,032 INFO L168 Benchmark]: TraceAbstraction took 187323.06 ms. Allocated memory was 401.6 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 269.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 105.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:37:30,033 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.10 ms. Allocated memory is still 401.6 MB. Free memory is still 363.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.75 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 345.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.59 ms. Allocated memory is still 401.6 MB. Free memory was 345.1 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 784.41 ms. Allocated memory is still 401.6 MB. Free memory was 342.4 MB in the beginning and 269.0 MB in the end (delta: 73.5 MB). Peak memory consumption was 73.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 187323.06 ms. Allocated memory was 401.6 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 269.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 105.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_18 term size 53 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_18 term size 53: 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 /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-37-30-038.csv Received shutdown request...