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_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:19:39,676 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:19:39,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:19:39,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:19:39,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:19:39,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:19:39,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:19:39,692 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:19:39,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:19:39,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:19:39,695 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:19:39,696 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:19:39,696 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:19:39,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:19:39,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:19:39,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:19:39,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:19:39,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:19:39,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:19:39,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:19:39,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:19:39,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:19:39,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:19:39,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:19:39,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:19:39,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:19:39,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:19:39,710 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:19:39,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:19:39,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:19:39,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:19:39,711 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:19:39,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:19:39,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:19:39,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:19:39,721 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:19:39,721 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:19:39,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:19:39,722 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:19:39,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:19:39,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:19:39,723 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:19:39,723 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:19:39,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:19:39,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:19:39,723 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:19:39,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:19:39,723 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:19:39,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:19:39,760 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:19:39,763 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:19:39,764 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:19:39,764 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:19:39,765 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_false-valid-deref.i [2018-02-04 18:19:39,912 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:19:39,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:19:39,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:19:39,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:19:39,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:19:39,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:19:39" (1/1) ... [2018-02-04 18:19:39,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbafac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:39, skipping insertion in model container [2018-02-04 18:19:39,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:19:39" (1/1) ... [2018-02-04 18:19:39,937 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:19:39,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:19:40,063 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:19:40,087 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:19:40,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40 WrapperNode [2018-02-04 18:19:40,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:19:40,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:19:40,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:19:40,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:19:40,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (1/1) ... [2018-02-04 18:19:40,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (1/1) ... [2018-02-04 18:19:40,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (1/1) ... [2018-02-04 18:19:40,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (1/1) ... [2018-02-04 18:19:40,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (1/1) ... [2018-02-04 18:19:40,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (1/1) ... [2018-02-04 18:19:40,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (1/1) ... [2018-02-04 18:19:40,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:19:40,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:19:40,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:19:40,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:19:40,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (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:19:40,167 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:19:40,168 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:19:40,168 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-02-04 18:19:40,168 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-02-04 18:19:40,168 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 18:19:40,168 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:19:40,168 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:19:40,168 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:19:40,168 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:19:40,169 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-02-04 18:19:40,170 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-02-04 18:19:40,170 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 18:19:40,170 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:19:40,170 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:19:40,170 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:19:40,715 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:19:40,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:19:40 BoogieIcfgContainer [2018-02-04 18:19:40,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:19:40,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:19:40,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:19:40,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:19:40,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:19:39" (1/3) ... [2018-02-04 18:19:40,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fce06fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:19:40, skipping insertion in model container [2018-02-04 18:19:40,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:19:40" (2/3) ... [2018-02-04 18:19:40,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fce06fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:19:40, skipping insertion in model container [2018-02-04 18:19:40,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:19:40" (3/3) ... [2018-02-04 18:19:40,720 INFO L107 eAbstractionObserver]: Analyzing ICFG split_list_test05_false-valid-deref.i [2018-02-04 18:19:40,725 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:19:40,730 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-02-04 18:19:40,753 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:19:40,754 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:19:40,754 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:19:40,754 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:19:40,754 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:19:40,754 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:19:40,754 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:19:40,755 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:19:40,755 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:19:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states. [2018-02-04 18:19:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:19:40,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:40,778 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:19:40,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:19:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash 479486545, now seen corresponding path program 1 times [2018-02-04 18:19:40,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:40,782 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:40,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:40,812 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:40,812 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:40,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:40,879 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:19:40,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:40,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:19:40,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:19:40,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:19:40,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:19:40,959 INFO L87 Difference]: Start difference. First operand 332 states. Second operand 4 states. [2018-02-04 18:19:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:41,324 INFO L93 Difference]: Finished difference Result 387 states and 432 transitions. [2018-02-04 18:19:41,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:19:41,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 18:19:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:41,337 INFO L225 Difference]: With dead ends: 387 [2018-02-04 18:19:41,337 INFO L226 Difference]: Without dead ends: 384 [2018-02-04 18:19:41,338 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:19:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-04 18:19:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 344. [2018-02-04 18:19:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-04 18:19:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 388 transitions. [2018-02-04 18:19:41,391 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 388 transitions. Word has length 8 [2018-02-04 18:19:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:41,391 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 388 transitions. [2018-02-04 18:19:41,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:19:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 388 transitions. [2018-02-04 18:19:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:19:41,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:41,391 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:19:41,392 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:19:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash 479486546, now seen corresponding path program 1 times [2018-02-04 18:19:41,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:41,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:41,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:41,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:41,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:41,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:41,444 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:19:41,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:41,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:19:41,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:19:41,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:19:41,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:19:41,446 INFO L87 Difference]: Start difference. First operand 344 states and 388 transitions. Second operand 4 states. [2018-02-04 18:19:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:41,649 INFO L93 Difference]: Finished difference Result 346 states and 392 transitions. [2018-02-04 18:19:41,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:19:41,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 18:19:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:41,651 INFO L225 Difference]: With dead ends: 346 [2018-02-04 18:19:41,652 INFO L226 Difference]: Without dead ends: 346 [2018-02-04 18:19:41,652 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:19:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-04 18:19:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2018-02-04 18:19:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-04 18:19:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 386 transitions. [2018-02-04 18:19:41,667 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 386 transitions. Word has length 8 [2018-02-04 18:19:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:41,667 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 386 transitions. [2018-02-04 18:19:41,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:19:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 386 transitions. [2018-02-04 18:19:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:19:41,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:41,668 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:19:41,668 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:19:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2063719306, now seen corresponding path program 1 times [2018-02-04 18:19:41,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:41,669 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:41,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:41,670 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:41,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:41,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:41,719 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:19:41,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:41,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:19:41,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:19:41,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:19:41,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:19:41,720 INFO L87 Difference]: Start difference. First operand 342 states and 386 transitions. Second operand 4 states. [2018-02-04 18:19:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:41,934 INFO L93 Difference]: Finished difference Result 337 states and 381 transitions. [2018-02-04 18:19:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:19:41,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 18:19:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:41,937 INFO L225 Difference]: With dead ends: 337 [2018-02-04 18:19:41,937 INFO L226 Difference]: Without dead ends: 337 [2018-02-04 18:19:41,937 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:19:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-04 18:19:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-02-04 18:19:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-04 18:19:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 381 transitions. [2018-02-04 18:19:41,954 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 381 transitions. Word has length 18 [2018-02-04 18:19:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:41,954 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 381 transitions. [2018-02-04 18:19:41,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:19:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 381 transitions. [2018-02-04 18:19:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 18:19:41,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:41,955 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:19:41,955 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:19:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2063719305, now seen corresponding path program 1 times [2018-02-04 18:19:41,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:41,956 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:41,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:41,957 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:41,957 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:41,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:42,013 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:19:42,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:42,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:19:42,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:19:42,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:19:42,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:19:42,014 INFO L87 Difference]: Start difference. First operand 337 states and 381 transitions. Second operand 4 states. [2018-02-04 18:19:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:42,172 INFO L93 Difference]: Finished difference Result 332 states and 376 transitions. [2018-02-04 18:19:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 18:19:42,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 18:19:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:42,173 INFO L225 Difference]: With dead ends: 332 [2018-02-04 18:19:42,173 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 18:19:42,173 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:19:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 18:19:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-02-04 18:19:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-02-04 18:19:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2018-02-04 18:19:42,179 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 18 [2018-02-04 18:19:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:42,179 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2018-02-04 18:19:42,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:19:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2018-02-04 18:19:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:19:42,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:42,179 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:19:42,179 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:19:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash 449211379, now seen corresponding path program 1 times [2018-02-04 18:19:42,180 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:42,180 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:42,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:42,180 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:42,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:42,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:42,200 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:19:42,200 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:19:42,200 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:19:42,201 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:42,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:19:42,258 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:19:42,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:42,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:42,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:19:42,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:19:42,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:42,282 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:19:42,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:19:42,288 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:19:42,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:42,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:19:42,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:19:42,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:19:42,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:19:42,289 INFO L87 Difference]: Start difference. First operand 332 states and 376 transitions. Second operand 6 states. [2018-02-04 18:19:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:42,665 INFO L93 Difference]: Finished difference Result 364 states and 409 transitions. [2018-02-04 18:19:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:19:42,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 18:19:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:42,666 INFO L225 Difference]: With dead ends: 364 [2018-02-04 18:19:42,666 INFO L226 Difference]: Without dead ends: 364 [2018-02-04 18:19:42,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:19:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-04 18:19:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 324. [2018-02-04 18:19:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-04 18:19:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 368 transitions. [2018-02-04 18:19:42,672 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 368 transitions. Word has length 19 [2018-02-04 18:19:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:42,672 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 368 transitions. [2018-02-04 18:19:42,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:19:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 368 transitions. [2018-02-04 18:19:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:19:42,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:42,673 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:19:42,673 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:19:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash 449211380, now seen corresponding path program 1 times [2018-02-04 18:19:42,674 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:42,674 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:42,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:42,675 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:42,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:42,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:42,706 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:19:42,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:19:42,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:19:42,707 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:42,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:19:42,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 18:19:42,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:42,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:42,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:19:42,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:42,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:42,799 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:19:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:42,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 18:19:42,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:42,814 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:19:42,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-02-04 18:19:42,830 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:19:42,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:42,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:19:42,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:19:42,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:19:42,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:19:42,832 INFO L87 Difference]: Start difference. First operand 324 states and 368 transitions. Second operand 9 states. [2018-02-04 18:19:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:43,581 INFO L93 Difference]: Finished difference Result 355 states and 400 transitions. [2018-02-04 18:19:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:19:43,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 18:19:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:43,583 INFO L225 Difference]: With dead ends: 355 [2018-02-04 18:19:43,583 INFO L226 Difference]: Without dead ends: 355 [2018-02-04 18:19:43,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:19:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-04 18:19:43,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 316. [2018-02-04 18:19:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 18:19:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 359 transitions. [2018-02-04 18:19:43,587 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 359 transitions. Word has length 19 [2018-02-04 18:19:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:43,595 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 359 transitions. [2018-02-04 18:19:43,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:19:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 359 transitions. [2018-02-04 18:19:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 18:19:43,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:43,596 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:19:43,597 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:19:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1619802097, now seen corresponding path program 1 times [2018-02-04 18:19:43,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:43,597 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:43,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:43,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:43,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:43,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:43,617 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:19:43,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:19:43,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:19:43,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:43,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:19:43,667 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:19:43,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:19:43,683 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:19:43,685 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:19:43,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,702 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:19:43,707 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:19:43,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 18:19:43,735 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:19:43,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:43,739 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:19:43,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,760 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:19:43,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:43,764 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:19:43,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,795 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-02-04 18:19:43,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:43,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:43,837 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:19:43,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,846 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:19:43,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:46 [2018-02-04 18:19:43,894 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:19:43,897 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:19:43,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,916 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:19:43,918 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:19:43,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,929 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:19:43,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2018-02-04 18:19:43,944 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:19:43,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:43,947 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:19:43,947 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:19:43,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,958 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:19:43,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:43,972 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:19:43,973 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:19:43,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:43,979 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:19:43,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-02-04 18:19:44,009 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:19:44,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:44,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 18:19:44,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:19:44,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:19:44,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:19:44,010 INFO L87 Difference]: Start difference. First operand 316 states and 359 transitions. Second operand 13 states. [2018-02-04 18:19:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:44,820 INFO L93 Difference]: Finished difference Result 339 states and 385 transitions. [2018-02-04 18:19:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 18:19:44,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-04 18:19:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:44,822 INFO L225 Difference]: With dead ends: 339 [2018-02-04 18:19:44,822 INFO L226 Difference]: Without dead ends: 339 [2018-02-04 18:19:44,823 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:19:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-04 18:19:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 327. [2018-02-04 18:19:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 18:19:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 372 transitions. [2018-02-04 18:19:44,831 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 372 transitions. Word has length 28 [2018-02-04 18:19:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:44,832 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 372 transitions. [2018-02-04 18:19:44,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:19:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 372 transitions. [2018-02-04 18:19:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 18:19:44,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:44,832 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:19:44,833 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:19:44,833 INFO L82 PathProgramCache]: Analyzing trace with hash -82034476, now seen corresponding path program 1 times [2018-02-04 18:19:44,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:44,833 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:44,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:44,834 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:44,834 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:44,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:44,858 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:19:44,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:19:44,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:19:44,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:44,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:19:44,903 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:19:44,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:19:44,921 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:19:44,923 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:19:44,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,934 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:19:44,936 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:19:44,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-04 18:19:44,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:44,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:44,977 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:19:44,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:44,984 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:19:44,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:29 [2018-02-04 18:19:45,031 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:19:45,033 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:19:45,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:45,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:45,069 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:19:45,071 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:19:45,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:45,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:45,077 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:19:45,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:25 [2018-02-04 18:19:45,196 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:19:45,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:19:45,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 18:19:45,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:19:45,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:19:45,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:19:45,197 INFO L87 Difference]: Start difference. First operand 327 states and 372 transitions. Second operand 13 states. [2018-02-04 18:19:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:45,789 INFO L93 Difference]: Finished difference Result 332 states and 377 transitions. [2018-02-04 18:19:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 18:19:45,790 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-04 18:19:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:45,790 INFO L225 Difference]: With dead ends: 332 [2018-02-04 18:19:45,791 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 18:19:45,791 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:19:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 18:19:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-02-04 18:19:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-04 18:19:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 375 transitions. [2018-02-04 18:19:45,798 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 375 transitions. Word has length 30 [2018-02-04 18:19:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:45,798 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 375 transitions. [2018-02-04 18:19:45,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:19:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-02-04 18:19:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 18:19:45,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:45,800 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:19:45,800 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:19:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash -156377040, now seen corresponding path program 1 times [2018-02-04 18:19:45,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:45,800 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:45,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:45,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:45,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:45,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:45,835 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:19:45,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:19:45,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:19:45,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:45,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:19:45,915 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:19:45,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:45,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:45,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:19:45,995 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:19:45,997 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:19:45,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:45,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:46,007 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:19:46,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-04 18:19:46,040 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:19:46,050 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:19:46,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 18:19:46,072 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:19:46,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:46,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:19:46,103 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:19:46,104 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77 [2018-02-04 18:19:46,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 41 treesize of output 36 [2018-02-04 18:19:46,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:46,169 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:19:46,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:46,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:46,220 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 71 [2018-02-04 18:19:46,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:46,228 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 67 treesize of output 82 [2018-02-04 18:19:46,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:46,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:46,275 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 49 treesize of output 60 [2018-02-04 18:19:46,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:19:46,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:19:46,344 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:19:46,344 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141 [2018-02-04 18:19:47,392 WARN L143 SmtUtils]: Spent 1013ms on a formula simplification that was a NOOP. DAG size: 62 [2018-02-04 18:19:47,401 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:19:47,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-04 18:19:47,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,443 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:19:47,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66 [2018-02-04 18:19:47,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,541 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 64 [2018-02-04 18:19:47,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,557 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:19:47,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-02-04 18:19:47,639 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:19:47,642 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:19:47,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,668 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:19:47,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:85 [2018-02-04 18:19:47,804 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 81 treesize of output 79 [2018-02-04 18:19:47,806 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:19:47,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,826 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:19:47,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:100 [2018-02-04 18:19:47,879 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 90 treesize of output 86 [2018-02-04 18:19:47,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,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, 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:19:47,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,907 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:19:47,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:109 [2018-02-04 18:19:47,950 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 95 treesize of output 76 [2018-02-04 18:19:47,953 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:19:47,954 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 44 treesize of output 40 [2018-02-04 18:19:47,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2018-02-04 18:19:47,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,977 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:47,977 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:19:47,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:47,990 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:19:47,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:118, output treesize:28 [2018-02-04 18:19:48,025 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:19:48,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:19:48,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 18:19:48,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 18:19:48,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 18:19:48,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:19:48,025 INFO L87 Difference]: Start difference. First operand 330 states and 375 transitions. Second operand 23 states. [2018-02-04 18:19:48,544 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 75 DAG size of output 73 [2018-02-04 18:19:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:19:51,709 INFO L93 Difference]: Finished difference Result 439 states and 540 transitions. [2018-02-04 18:19:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:19:51,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2018-02-04 18:19:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:19:51,712 INFO L225 Difference]: With dead ends: 439 [2018-02-04 18:19:51,712 INFO L226 Difference]: Without dead ends: 439 [2018-02-04 18:19:51,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 18:19:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-02-04 18:19:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 377. [2018-02-04 18:19:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-04 18:19:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 472 transitions. [2018-02-04 18:19:51,722 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 472 transitions. Word has length 47 [2018-02-04 18:19:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:19:51,723 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 472 transitions. [2018-02-04 18:19:51,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 18:19:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 472 transitions. [2018-02-04 18:19:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 18:19:51,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:19:51,724 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:19:51,724 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:19:51,724 INFO L82 PathProgramCache]: Analyzing trace with hash -156377039, now seen corresponding path program 1 times [2018-02-04 18:19:51,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:19:51,724 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:19:51,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:51,725 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:51,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:19:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:51,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:19:51,752 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:19:51,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:19:51,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:19:51,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:19:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:19:51,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:19:51,832 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:19:51,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:19:51,915 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:19:51,916 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:19:51,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-02-04 18:19:51,950 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:19:51,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:51,953 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:19:51,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,972 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:19:51,973 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:19:51,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:51,987 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:19:51,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:54 [2018-02-04 18:19:52,025 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:19:52,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,031 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:19:52,031 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:19:52,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,048 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:19:52,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,132 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:19:52,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,138 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 34 treesize of output 45 [2018-02-04 18:19:52,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,160 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 35 treesize of output 34 [2018-02-04 18:19:52,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,187 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:19:52,187 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:78 [2018-02-04 18:19:52,238 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 155 treesize of output 149 [2018-02-04 18:19:52,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,248 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:19:52,248 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 129 treesize of output 129 [2018-02-04 18:19:52,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,338 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 138 treesize of output 165 [2018-02-04 18:19:52,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,407 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 137 treesize of output 128 [2018-02-04 18:19:52,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,413 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 130 treesize of output 157 [2018-02-04 18:19:52,413 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,465 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 115 treesize of output 141 [2018-02-04 18:19:52,466 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 18:19:52,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:19:52,534 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:19:52,534 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:189, output treesize:280 [2018-02-04 18:19:52,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,600 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 177 treesize of output 176 [2018-02-04 18:19:52,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:19:52,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:289, output treesize:170 [2018-02-04 18:19:52,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,727 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 26 treesize of output 35 [2018-02-04 18:19:52,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:52,754 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:19:52,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,775 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:19:52,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:184, output treesize:176 [2018-02-04 18:19:52,851 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 150 treesize of output 171 [2018-02-04 18:19:52,858 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:19:52,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,904 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 139 treesize of output 137 [2018-02-04 18:19:52,906 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:19:52,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:52,939 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:19:52,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:206, output treesize:176 [2018-02-04 18:19:53,018 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 137 treesize of output 135 [2018-02-04 18:19:53,020 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:19:53,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,069 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 148 treesize of output 169 [2018-02-04 18:19:53,071 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:19:53,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,116 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:19:53,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:202, output treesize:176 [2018-02-04 18:19:53,154 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 135 treesize of output 133 [2018-02-04 18:19:53,158 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:19:53,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,204 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 146 treesize of output 167 [2018-02-04 18:19:53,206 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:19:53,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,249 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:19:53,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:195, output treesize:187 [2018-02-04 18:19:53,290 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 140 treesize of output 121 [2018-02-04 18:19:53,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:53,293 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:19:53,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,305 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:19:53,306 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 79 treesize of output 59 [2018-02-04 18:19:53,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,338 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 91 treesize of output 81 [2018-02-04 18:19:53,340 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:19:53,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:53,341 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 64 treesize of output 41 [2018-02-04 18:19:53,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:19:53,352 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:19:53,352 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:19:53,366 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:19:53,366 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:205, output treesize:23 [2018-02-04 18:19:53,410 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:19:53,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:19:53,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:19:53,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:19:53,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:19:53,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:19:53,411 INFO L87 Difference]: Start difference. First operand 377 states and 472 transitions. Second operand 21 states. [2018-02-04 18:20:15,644 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 132 DAG size of output 86 [2018-02-04 18:20:15,837 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 143 DAG size of output 97 [2018-02-04 18:20:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:20:34,370 INFO L93 Difference]: Finished difference Result 522 states and 658 transitions. [2018-02-04 18:20:34,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:20:34,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-02-04 18:20:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:20:34,372 INFO L225 Difference]: With dead ends: 522 [2018-02-04 18:20:34,373 INFO L226 Difference]: Without dead ends: 522 [2018-02-04 18:20:34,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 18:20:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-04 18:20:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 426. [2018-02-04 18:20:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-02-04 18:20:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 556 transitions. [2018-02-04 18:20:34,386 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 556 transitions. Word has length 47 [2018-02-04 18:20:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:20:34,386 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 556 transitions. [2018-02-04 18:20:34,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:20:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 556 transitions. [2018-02-04 18:20:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 18:20:34,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:20:34,388 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:20:34,388 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:20:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 95508552, now seen corresponding path program 1 times [2018-02-04 18:20:34,388 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:20:34,389 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:20:34,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:34,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:20:34,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:34,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:20:34,460 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:20:34,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:20:34,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:20:34,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:20:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:34,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:20:34,614 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:20:34,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 18:20:34,641 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:20:34,642 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:20:34,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,646 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:20:34,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-02-04 18:20:34,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:34,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:34,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:34,691 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:20:34,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:42 [2018-02-04 18:20:34,739 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:20: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 12 treesize of output 1 [2018-02-04 18:20:34,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-02-04 18:20:34,776 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 41 treesize of output 42 [2018-02-04 18:20:34,777 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 16 treesize of output 15 [2018-02-04 18:20:34,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2018-02-04 18:20:34,827 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 50 treesize of output 49 [2018-02-04 18:20:34,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:34,830 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:20:34,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,845 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:20:34,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-04 18:20:34,868 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 55 treesize of output 47 [2018-02-04 18:20:34,870 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 36 treesize of output 25 [2018-02-04 18:20:34,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:34,877 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 32 treesize of output 18 [2018-02-04 18:20:34,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:34,888 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:20:34,888 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:75, output treesize:24 [2018-02-04 18:20:34,914 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:20:34,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:20:34,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:20:34,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:20:34,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:20:34,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:20:34,915 INFO L87 Difference]: Start difference. First operand 426 states and 556 transitions. Second operand 21 states. [2018-02-04 18:20:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:20:36,440 INFO L93 Difference]: Finished difference Result 486 states and 622 transitions. [2018-02-04 18:20:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:20:36,441 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-02-04 18:20:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:20:36,442 INFO L225 Difference]: With dead ends: 486 [2018-02-04 18:20:36,442 INFO L226 Difference]: Without dead ends: 486 [2018-02-04 18:20:36,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 18:20:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-02-04 18:20:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 425. [2018-02-04 18:20:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 18:20:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 554 transitions. [2018-02-04 18:20:36,452 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 554 transitions. Word has length 66 [2018-02-04 18:20:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:20:36,452 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 554 transitions. [2018-02-04 18:20:36,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:20:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 554 transitions. [2018-02-04 18:20:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 18:20:36,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:20:36,453 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:20:36,453 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:20:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash 95508553, now seen corresponding path program 1 times [2018-02-04 18:20:36,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:20:36,453 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:20:36,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:36,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:20:36,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:36,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:20:36,480 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:20:36,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:20:36,481 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:20:36,481 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:20:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:36,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:20:36,578 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:20:36,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 18:20:36,680 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:20:36,683 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:20:36,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,700 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:20:36,702 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:20:36,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,715 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:20:36,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:46 [2018-02-04 18:20:36,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:36,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:36,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:36,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:36,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2018-02-04 18:20:36,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 18:20:36,845 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 27 [2018-02-04 18:20:36,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,871 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:20:36,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:61 [2018-02-04 18:20:36,942 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:20:36,945 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:20:36,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,973 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:20:36,975 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:20:36,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:36,996 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:20:36,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:61 [2018-02-04 18:20:36,999 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 5 treesize of output 1 [2018-02-04 18:20:36,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,012 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:20:37,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-02-04 18:20:37,057 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:20:37,059 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:20:37,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,101 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:20:37,103 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:20:37,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,118 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:20:37,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:87, output treesize:61 [2018-02-04 18:20:37,124 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:20:37,126 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:20:37,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,145 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 33 treesize of output 34 [2018-02-04 18:20:37,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:20:37,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,160 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:20:37,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-02-04 18:20:37,220 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 38 treesize of output 34 [2018-02-04 18:20:37,222 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:20:37,222 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 17 [2018-02-04 18:20:37,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,243 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 35 treesize of output 31 [2018-02-04 18:20:37,245 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:20:37,246 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:20:37,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:37,259 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:20:37,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:90, output treesize:21 [2018-02-04 18:20:37,293 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:20:37,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:20:37,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:20:37,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:20:37,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:20:37,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:20:37,294 INFO L87 Difference]: Start difference. First operand 425 states and 554 transitions. Second operand 21 states. [2018-02-04 18:20:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:20:39,376 INFO L93 Difference]: Finished difference Result 492 states and 626 transitions. [2018-02-04 18:20:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:20:39,377 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-02-04 18:20:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:20:39,378 INFO L225 Difference]: With dead ends: 492 [2018-02-04 18:20:39,378 INFO L226 Difference]: Without dead ends: 492 [2018-02-04 18:20:39,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 18:20:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-02-04 18:20:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 434. [2018-02-04 18:20:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 18:20:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 561 transitions. [2018-02-04 18:20:39,385 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 561 transitions. Word has length 66 [2018-02-04 18:20:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:20:39,385 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 561 transitions. [2018-02-04 18:20:39,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:20:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 561 transitions. [2018-02-04 18:20:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 18:20:39,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:20:39,386 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:20:39,386 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:20:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash -846429153, now seen corresponding path program 1 times [2018-02-04 18:20:39,386 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:20:39,386 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:20:39,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:39,387 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:20:39,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:39,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:20:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 18:20:39,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:20:39,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:20:39,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:20:39,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:20:39,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:20:39,425 INFO L87 Difference]: Start difference. First operand 434 states and 561 transitions. Second operand 3 states. [2018-02-04 18:20:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:20:39,431 INFO L93 Difference]: Finished difference Result 437 states and 564 transitions. [2018-02-04 18:20:39,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:20:39,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-02-04 18:20:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:20:39,432 INFO L225 Difference]: With dead ends: 437 [2018-02-04 18:20:39,432 INFO L226 Difference]: Without dead ends: 437 [2018-02-04 18:20:39,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:20:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-02-04 18:20:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-02-04 18:20:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-04 18:20:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 564 transitions. [2018-02-04 18:20:39,441 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 564 transitions. Word has length 81 [2018-02-04 18:20:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:20:39,441 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 564 transitions. [2018-02-04 18:20:39,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:20:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 564 transitions. [2018-02-04 18:20:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 18:20:39,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:20:39,442 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:20:39,442 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:20:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1460447900, now seen corresponding path program 2 times [2018-02-04 18:20:39,442 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:20:39,443 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:20:39,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:39,443 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:20:39,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:39,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:20:39,468 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:20:39,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:20:39,468 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:20:39,469 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:20:39,533 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:20:39,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:20:39,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:20:39,543 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:20:39,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:20:39,553 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:20:39,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 18:20:39,642 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:20:39,643 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:20:39,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,650 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:20:39,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-02-04 18:20:39,674 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:20:39,676 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:20:39,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,701 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:20:39,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:20:39,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:20:39,725 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:20:39,725 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:79 [2018-02-04 18:20:39,788 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:20:39,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:39,791 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:20:39,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,827 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:20:39,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:39,829 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:20:39,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:39,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:39,869 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:20:39,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:20:39,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:20:39,920 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:20:39,920 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:118, output treesize:144 [2018-02-04 18:20:39,988 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:20:40,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,063 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:20:40,064 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 0 case distinctions, treesize of input 29 treesize of output 45 [2018-02-04 18:20:40,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,074 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:20:40,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:168, output treesize:66 [2018-02-04 18:20:40,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,131 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:20:40,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,145 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:20:40,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-02-04 18:20:40,194 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:20:40,195 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:20:40,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,212 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:20:40,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:85 [2018-02-04 18:20:40,277 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 81 treesize of output 79 [2018-02-04 18:20:40,278 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:20:40,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,298 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:20:40,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:103 [2018-02-04 18:20:40,337 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 90 treesize of output 86 [2018-02-04 18:20:40,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,341 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:20:40,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,364 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:20:40,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:116, output treesize:112 [2018-02-04 18:20:40,399 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 95 treesize of output 76 [2018-02-04 18:20:40,401 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:20:40,401 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 44 treesize of output 40 [2018-02-04 18:20:40,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2018-02-04 18:20:40,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:40,421 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:20:40,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:40,432 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:20:40,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:121, output treesize:28 [2018-02-04 18:20:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 18:20:40,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:20:40,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 18:20:40,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:20:40,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:20:40,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:20:40,468 INFO L87 Difference]: Start difference. First operand 437 states and 564 transitions. Second operand 26 states. [2018-02-04 18:20:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:20:46,019 INFO L93 Difference]: Finished difference Result 533 states and 667 transitions. [2018-02-04 18:20:46,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 18:20:46,020 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2018-02-04 18:20:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:20:46,021 INFO L225 Difference]: With dead ends: 533 [2018-02-04 18:20:46,021 INFO L226 Difference]: Without dead ends: 533 [2018-02-04 18:20:46,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 18:20:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-02-04 18:20:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 384. [2018-02-04 18:20:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-04 18:20:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 463 transitions. [2018-02-04 18:20:46,032 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 463 transitions. Word has length 83 [2018-02-04 18:20:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:20:46,033 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 463 transitions. [2018-02-04 18:20:46,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:20:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 463 transitions. [2018-02-04 18:20:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-02-04 18:20:46,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:20:46,037 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-02-04 18:20:46,037 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:20:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1145563202, now seen corresponding path program 1 times [2018-02-04 18:20:46,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:20:46,037 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:20:46,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:46,038 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:20:46,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:20:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:46,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:20:46,134 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:20:46,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:20:46,134 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:20:46,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:20:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:20:47,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:20:47,709 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:20:47,710 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:20:47,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-02-04 18:20:47,730 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:20:47,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:47,732 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:20:47,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-02-04 18:20:47,762 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:20:47,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:47,774 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:20:47,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-02-04 18:20:47,802 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:20:47,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:20:47,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:20:47,834 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:129 [2018-02-04 18:20:47,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 71 [2018-02-04 18:20:47,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:47,903 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 71 treesize of output 86 [2018-02-04 18:20:47,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:47,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:47,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:47,947 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 53 treesize of output 63 [2018-02-04 18:20:47,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 18:20:47,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:20:48,013 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 41 treesize of output 34 [2018-02-04 18:20:48,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,017 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:20:48,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,022 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,056 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 41 treesize of output 34 [2018-02-04 18:20:48,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,061 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:20:48,061 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,092 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:20:48,092 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:155, output treesize:171 [2018-02-04 18:20:48,143 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 18:20:48,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,167 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 0 case distinctions, treesize of input 25 treesize of output 34 [2018-02-04 18:20:48,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,192 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:20:48,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:203, output treesize:71 [2018-02-04 18:20:48,391 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:20:48,395 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:20:48,405 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:20:48,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:68 [2018-02-04 18:20:48,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,680 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 28 treesize of output 57 [2018-02-04 18:20:48,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,745 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 156 treesize of output 131 [2018-02-04 18:20:48,804 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:20:48,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,841 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 114 treesize of output 122 [2018-02-04 18:20:48,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,850 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:20:48,856 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 78 [2018-02-04 18:20:48,903 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 43 treesize of output 41 [2018-02-04 18:20:48,903 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,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, 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 40 [2018-02-04 18:20:48,925 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,940 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:20:48,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,962 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:20:48,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,965 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:20:48,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:20:48,970 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:20:48,970 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,976 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,988 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:20:48,999 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:20:49,009 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:20:49,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:20:49,029 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:181, output treesize:103 [2018-02-04 18:20:49,197 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:20:49,199 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:20:49,205 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:20:49,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:38 [2018-02-04 18:20:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 695 proven. 30 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2018-02-04 18:20:49,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:20:49,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-04 18:20:49,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 18:20:49,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 18:20:49,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1136, Unknown=43, NotChecked=0, Total=1332 [2018-02-04 18:20:49,434 INFO L87 Difference]: Start difference. First operand 384 states and 463 transitions. Second operand 37 states. [2018-02-04 18:21:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:21:00,408 INFO L93 Difference]: Finished difference Result 601 states and 766 transitions. [2018-02-04 18:21:00,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:21:00,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 266 [2018-02-04 18:21:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:21:00,410 INFO L225 Difference]: With dead ends: 601 [2018-02-04 18:21:00,411 INFO L226 Difference]: Without dead ends: 601 [2018-02-04 18:21:00,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=364, Invalid=2656, Unknown=60, NotChecked=0, Total=3080 [2018-02-04 18:21:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-02-04 18:21:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 450. [2018-02-04 18:21:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-02-04 18:21:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 601 transitions. [2018-02-04 18:21:00,426 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 601 transitions. Word has length 266 [2018-02-04 18:21:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:21:00,426 INFO L432 AbstractCegarLoop]: Abstraction has 450 states and 601 transitions. [2018-02-04 18:21:00,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 18:21:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 601 transitions. [2018-02-04 18:21:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-02-04 18:21:00,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:21:00,432 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:00,432 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:21:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1911950402, now seen corresponding path program 1 times [2018-02-04 18:21:00,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:21:00,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:21:00,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:21:00,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:21:00,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:21:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:21:00,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:21:00,522 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:21:00,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:21:00,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:21:00,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:21:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:21:02,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:21:02,172 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:21:02,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-02-04 18:21:02,272 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:21:02,273 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:21:02,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 18:21:02,299 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:21:02,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,301 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:21:02,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,310 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:21:02,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-02-04 18:21:02,339 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:21:02,341 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:21:02,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,366 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:21:02,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 18:21:02,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:21:02,410 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:21:02,410 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:51, output treesize:140 [2018-02-04 18:21:02,505 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:21:02,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,517 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:21:02,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,581 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 87 treesize of output 78 [2018-02-04 18:21:02,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,586 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 76 treesize of output 89 [2018-02-04 18:21:02,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,644 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 54 treesize of output 68 [2018-02-04 18:21:02,644 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:02,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:02,734 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 50 treesize of output 43 [2018-02-04 18:21:02,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,741 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:21:02,741 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,751 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,791 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:21:02,791 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:190, output treesize:207 [2018-02-04 18:21:02,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:02,927 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 81 treesize of output 85 [2018-02-04 18:21:02,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:02,992 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:21:02,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:239, output treesize:75 [2018-02-04 18:21:03,167 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:21:03,169 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:21:03,176 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 1 xjuncts. [2018-02-04 18:21:03,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:39 [2018-02-04 18:21:03,569 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 75 DAG size of output 73 [2018-02-04 18:21:03,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,590 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 28 treesize of output 67 [2018-02-04 18:21:03,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:03,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,697 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 169 treesize of output 168 [2018-02-04 18:21:03,794 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 53 treesize of output 52 [2018-02-04 18:21:03,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,799 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 52 treesize of output 55 [2018-02-04 18:21:03,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,809 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 49 treesize of output 69 [2018-02-04 18:21:03,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:03,821 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:03,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:03,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,862 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 121 treesize of output 127 [2018-02-04 18:21:03,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,888 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 0 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 77 [2018-02-04 18:21:03,889 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-02-04 18:21:03,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,963 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 116 treesize of output 118 [2018-02-04 18:21:03,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:03,971 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2018-02-04 18:21:03,971 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,010 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,018 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 116 treesize of output 118 [2018-02-04 18:21:04,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,027 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2018-02-04 18:21:04,027 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,060 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,068 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 116 treesize of output 118 [2018-02-04 18:21:04,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,077 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2018-02-04 18:21:04,077 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,112 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,121 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 118 treesize of output 120 [2018-02-04 18:21:04,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,130 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 93 [2018-02-04 18:21:04,130 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,163 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:04,295 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-02-04 18:21:04,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-02-04 18:21:04,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 147 [2018-02-04 18:21:04,477 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:21:04,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,481 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:21:04,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,489 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:21:04,489 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:04,500 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:04,506 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:04,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 150 [2018-02-04 18:21:04,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:04,594 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 134 treesize of output 161 [2018-02-04 18:21:04,595 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-02-04 18:21:07,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:07,750 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 121 [2018-02-04 18:21:07,752 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 18:21:09,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 130 [2018-02-04 18:21:09,668 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:11,445 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:21:13,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:13,198 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:21:13,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 141 [2018-02-04 18:21:13,219 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 18:21:14,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:14,776 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 110 treesize of output 103 [2018-02-04 18:21:14,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:14,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:14,787 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:14,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 18 case distinctions, treesize of input 66 treesize of output 186 [2018-02-04 18:21:14,847 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-04 18:21:14,901 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 256 xjuncts. [2018-02-04 18:21:17,062 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 33 xjuncts. [2018-02-04 18:21:21,124 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2018-02-04 18:21:21,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:21,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 83 [2018-02-04 18:21:21,135 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:21:21,180 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:21:21,190 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 99 [2018-02-04 18:21:21,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:21,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2018-02-04 18:21:21,193 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:21,211 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:21:21,234 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-02-04 18:21:21,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:21,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:21,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 112 [2018-02-04 18:21:21,244 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:21,284 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:24,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:24,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:24,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 130 [2018-02-04 18:21:24,473 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 18:21:29,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:29,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 142 [2018-02-04 18:21:29,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:29,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:29,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 142 [2018-02-04 18:21:29,883 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:30,002 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 18:21:31,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:31,581 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 105 treesize of output 104 [2018-02-04 18:21:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:31,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:31,589 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 2 case distinctions, treesize of input 42 treesize of output 55 [2018-02-04 18:21:31,590 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:31,618 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:31,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:31,625 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 105 treesize of output 104 [2018-02-04 18:21:31,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:31,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:31,633 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 2 case distinctions, treesize of input 42 treesize of output 55 [2018-02-04 18:21:31,634 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:31,661 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:21:32,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:32,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 139 [2018-02-04 18:21:32,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:32,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:32,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 139 [2018-02-04 18:21:32,200 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:32,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:32,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:21:32,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 136 [2018-02-04 18:21:32,291 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-02-04 18:21:32,355 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 18:21:32,868 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, 9 dim-2 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-02-04 18:21:33,074 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-02-04 18:21:33,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 65 dim-0 vars, and 16 xjuncts. [2018-02-04 18:21:33,514 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 11 variables, input treesize:199, output treesize:2098 [2018-02-04 18:21:39,169 WARN L146 SmtUtils]: Spent 5405ms on a formula simplification. DAG size of input: 602 DAG size of output 564 [2018-02-04 18:21:39,594 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:21:39,609 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:21:39,624 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:21:39,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:68 Received shutdown request... [2018-02-04 18:23:08,801 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 18:23:08,801 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 18:23:08,806 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 18:23:08,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:23:08 BoogieIcfgContainer [2018-02-04 18:23:08,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:23:08,807 INFO L168 Benchmark]: Toolchain (without parser) took 208894.71 ms. Allocated memory was 402.7 MB in the beginning and 1.2 GB in the end (delta: 825.2 MB). Free memory was 359.5 MB in the beginning and 519.5 MB in the end (delta: -160.0 MB). Peak memory consumption was 665.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:23:08,808 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:23:08,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.02 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 347.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:23:08,809 INFO L168 Benchmark]: Boogie Preprocessor took 36.20 ms. Allocated memory is still 402.7 MB. Free memory was 347.6 MB in the beginning and 345.0 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:23:08,809 INFO L168 Benchmark]: RCFGBuilder took 583.80 ms. Allocated memory is still 402.7 MB. Free memory was 345.0 MB in the beginning and 270.7 MB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:23:08,809 INFO L168 Benchmark]: TraceAbstraction took 208090.66 ms. Allocated memory was 402.7 MB in the beginning and 1.2 GB in the end (delta: 825.2 MB). Free memory was 270.7 MB in the beginning and 519.5 MB in the end (delta: -248.8 MB). Peak memory consumption was 576.4 MB. Max. memory is 5.3 GB. [2018-02-04 18:23:08,811 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.14 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 181.02 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 347.6 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.20 ms. Allocated memory is still 402.7 MB. Free memory was 347.6 MB in the beginning and 345.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 583.80 ms. Allocated memory is still 402.7 MB. Free memory was 345.0 MB in the beginning and 270.7 MB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 208090.66 ms. Allocated memory was 402.7 MB in the beginning and 1.2 GB in the end (delta: 825.2 MB). Free memory was 270.7 MB in the beginning and 519.5 MB in the end (delta: -248.8 MB). Peak memory consumption was 576.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 611). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 617). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 621). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 616). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 611). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 617). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 622). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 616). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 602). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 621). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 603). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 602). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 603). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 612). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 275 with TraceHistMax 14, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1133. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 332 locations, 141 error locations. TIMEOUT Result, 208.0s OverallTime, 16 OverallIterations, 14 TraceHistogramMax, 68.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4460 SDtfs, 4825 SDslu, 18582 SDs, 0 SdLazy, 26944 SolverSat, 1505 SolverUnsat, 41 SolverUnknown, 0 SolverNotchecked, 58.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 503 SyntacticMatches, 6 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 714 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1475 NumberOfCodeBlocks, 1475 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 789 ConstructedInterpolants, 119 QuantifiedInterpolants, 1436947 SizeOfPredicates, 179 NumberOfNonLiveVariables, 3468 ConjunctsInSsa, 492 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 1549/1666 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-23-08-819.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-23-08-819.csv Completed graceful shutdown