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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 10:59:38,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 10:59:38,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 10:59:38,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 10:59:38,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 10:59:38,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 10:59:38,453 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 10:59:38,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 10:59:38,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 10:59:38,457 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 10:59:38,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 10:59:38,458 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 10:59:38,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 10:59:38,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 10:59:38,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 10:59:38,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 10:59:38,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 10:59:38,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 10:59:38,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 10:59:38,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 10:59:38,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 10:59:38,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 10:59:38,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 10:59:38,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 10:59:38,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 10:59:38,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 10:59:38,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 10:59:38,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 10:59:38,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 10:59:38,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 10:59:38,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 10:59:38,473 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-04-13 10:59:38,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 10:59:38,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 10:59:38,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 10:59:38,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 10:59:38,484 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 10:59:38,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 10:59:38,484 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 10:59:38,484 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 10:59:38,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 10:59:38,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 10:59:38,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 10:59:38,486 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 10:59:38,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 10:59:38,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 10:59:38,486 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 10:59:38,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 10:59:38,486 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 10:59:38,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 10:59:38,521 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 10:59:38,524 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 10:59:38,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 10:59:38,525 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 10:59:38,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-04-13 10:59:38,819 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d1383b90 [2018-04-13 10:59:38,907 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 10:59:38,907 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 10:59:38,908 INFO L168 CDTParser]: Scanning test-bitfields-2_false-valid-deref.i [2018-04-13 10:59:38,909 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 10:59:38,909 INFO L215 ultiparseSymbolTable]: [2018-04-13 10:59:38,909 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 10:59:38,909 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_false-valid-deref.i [2018-04-13 10:59:38,909 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 10:59:38,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-2_false-valid-deref.i [2018-04-13 10:59:38,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-2_false-valid-deref.i [2018-04-13 10:59:38,921 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3d1383b90 [2018-04-13 10:59:38,924 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 10:59:38,926 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 10:59:38,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 10:59:38,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 10:59:38,931 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 10:59:38,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:59:38" (1/1) ... [2018-04-13 10:59:38,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74844752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:38, skipping insertion in model container [2018-04-13 10:59:38,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:59:38" (1/1) ... [2018-04-13 10:59:38,945 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 10:59:38,954 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 10:59:39,054 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 10:59:39,074 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 10:59:39,080 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-13 10:59:39,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39 WrapperNode [2018-04-13 10:59:39,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 10:59:39,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 10:59:39,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 10:59:39,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 10:59:39,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (1/1) ... [2018-04-13 10:59:39,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (1/1) ... [2018-04-13 10:59:39,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (1/1) ... [2018-04-13 10:59:39,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (1/1) ... [2018-04-13 10:59:39,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (1/1) ... [2018-04-13 10:59:39,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (1/1) ... [2018-04-13 10:59:39,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (1/1) ... [2018-04-13 10:59:39,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 10:59:39,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 10:59:39,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 10:59:39,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 10:59:39,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (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-04-13 10:59:39,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 10:59:39,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 10:59:39,158 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 10:59:39,158 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-13 10:59:39,158 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-13 10:59:39,158 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 10:59:39,158 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 10:59:39,158 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 10:59:39,158 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 10:59:39,159 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-13 10:59:39,159 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 10:59:39,159 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 10:59:39,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 10:59:39,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 10:59:39,159 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 10:59:39,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 10:59:39,432 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-13 10:59:39,442 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 10:59:39,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 10:59:39 BoogieIcfgContainer [2018-04-13 10:59:39,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 10:59:39,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 10:59:39,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 10:59:39,444 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 10:59:39,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:59:38" (1/3) ... [2018-04-13 10:59:39,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42de32f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:59:39, skipping insertion in model container [2018-04-13 10:59:39,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:39" (2/3) ... [2018-04-13 10:59:39,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42de32f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:59:39, skipping insertion in model container [2018-04-13 10:59:39,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 10:59:39" (3/3) ... [2018-04-13 10:59:39,447 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-04-13 10:59:39,452 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 10:59:39,457 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-13 10:59:39,479 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 10:59:39,480 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 10:59:39,480 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 10:59:39,480 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 10:59:39,480 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 10:59:39,480 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 10:59:39,480 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 10:59:39,480 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 10:59:39,480 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 10:59:39,481 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 10:59:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2018-04-13 10:59:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 10:59:39,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:39,496 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:39,496 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2048667359, now seen corresponding path program 1 times [2018-04-13 10:59:39,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:39,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:39,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:39,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:39,529 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:39,574 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:39,589 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 10:59:39,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:39,590 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:39,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:39,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:39,658 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-04-13 10:59:39,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:39,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:39,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 10:59:39,690 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-04-13 10:59:39,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:39,700 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-04-13 10:59:39,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-13 10:59:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:39,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 10:59:39,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 10:59:39,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 10:59:39,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 10:59:39,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 10:59:39,725 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2018-04-13 10:59:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:39,789 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-13 10:59:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 10:59:39,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-04-13 10:59:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:39,797 INFO L225 Difference]: With dead ends: 89 [2018-04-13 10:59:39,797 INFO L226 Difference]: Without dead ends: 86 [2018-04-13 10:59:39,798 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 10:59:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-13 10:59:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-13 10:59:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 10:59:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-13 10:59:39,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 15 [2018-04-13 10:59:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:39,822 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-13 10:59:39,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 10:59:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-13 10:59:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 10:59:39,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:39,823 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:39,823 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:39,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2048667360, now seen corresponding path program 1 times [2018-04-13 10:59:39,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:39,824 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:39,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:39,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:39,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:39,837 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:39,840 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 10:59:39,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:39,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:39,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:39,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:39,867 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-04-13 10:59:39,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:39,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:39,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 10:59:39,877 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-04-13 10:59:39,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:39,880 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-04-13 10:59:39,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 10:59:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:39,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 10:59:39,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 10:59:39,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 10:59:39,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 10:59:39,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 10:59:39,884 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 3 states. [2018-04-13 10:59:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:39,983 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-04-13 10:59:39,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 10:59:39,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-04-13 10:59:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:39,985 INFO L225 Difference]: With dead ends: 121 [2018-04-13 10:59:39,985 INFO L226 Difference]: Without dead ends: 121 [2018-04-13 10:59:39,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 10:59:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-13 10:59:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2018-04-13 10:59:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-13 10:59:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-04-13 10:59:39,996 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 15 [2018-04-13 10:59:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:39,997 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-04-13 10:59:39,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 10:59:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-04-13 10:59:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 10:59:39,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:39,997 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:39,997 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781157, now seen corresponding path program 1 times [2018-04-13 10:59:39,998 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:39,998 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:40,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,015 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 10:59:40,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 10:59:40,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 10:59:40,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 10:59:40,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 10:59:40,058 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 4 states. [2018-04-13 10:59:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:40,148 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-04-13 10:59:40,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 10:59:40,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 10:59:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:40,149 INFO L225 Difference]: With dead ends: 68 [2018-04-13 10:59:40,149 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 10:59:40,149 INFO L567 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-04-13 10:59:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 10:59:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-13 10:59:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 10:59:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-04-13 10:59:40,152 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 20 [2018-04-13 10:59:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:40,152 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-04-13 10:59:40,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 10:59:40,152 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-04-13 10:59:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 10:59:40,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:40,153 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:40,153 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1967781159, now seen corresponding path program 1 times [2018-04-13 10:59:40,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:40,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:40,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,161 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 10:59:40,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 10:59:40,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 10:59:40,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 10:59:40,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 10:59:40,185 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 4 states. [2018-04-13 10:59:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:40,261 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-04-13 10:59:40,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 10:59:40,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-13 10:59:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:40,262 INFO L225 Difference]: With dead ends: 90 [2018-04-13 10:59:40,262 INFO L226 Difference]: Without dead ends: 90 [2018-04-13 10:59:40,262 INFO L567 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-04-13 10:59:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-13 10:59:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-04-13 10:59:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 10:59:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-04-13 10:59:40,267 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 20 [2018-04-13 10:59:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:40,267 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-04-13 10:59:40,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 10:59:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-04-13 10:59:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 10:59:40,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:40,268 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:40,268 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:40,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2114791798, now seen corresponding path program 1 times [2018-04-13 10:59:40,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:40,268 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:40,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,289 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 10:59:40,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 10:59:40,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 10:59:40,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 10:59:40,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 10:59:40,327 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 4 states. [2018-04-13 10:59:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:40,333 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-13 10:59:40,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 10:59:40,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-13 10:59:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:40,334 INFO L225 Difference]: With dead ends: 70 [2018-04-13 10:59:40,334 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 10:59:40,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-13 10:59:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 10:59:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-04-13 10:59:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 10:59:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-04-13 10:59:40,336 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 32 [2018-04-13 10:59:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:40,337 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-04-13 10:59:40,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 10:59:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-04-13 10:59:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 10:59:40,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:40,337 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:40,337 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1008408557, now seen corresponding path program 1 times [2018-04-13 10:59:40,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:40,337 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:40,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,349 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:40,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:40,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 10:59:40,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-13 10:59:40,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 10:59:40,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 10:59:40,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 10:59:40,418 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 8 states. [2018-04-13 10:59:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:40,456 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-13 10:59:40,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 10:59:40,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-13 10:59:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:40,456 INFO L225 Difference]: With dead ends: 71 [2018-04-13 10:59:40,456 INFO L226 Difference]: Without dead ends: 69 [2018-04-13 10:59:40,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-13 10:59:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-13 10:59:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-04-13 10:59:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-13 10:59:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-13 10:59:40,459 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 33 [2018-04-13 10:59:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:40,460 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-13 10:59:40,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 10:59:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-13 10:59:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 10:59:40,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:40,461 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:40,461 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -956628246, now seen corresponding path program 2 times [2018-04-13 10:59:40,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:40,461 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:40,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,476 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:40,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:40,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 10:59:40,551 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 10:59:40,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 10:59:40,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 10:59:40,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-13 10:59:40,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 10:59:40,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 10:59:40,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-13 10:59:40,575 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 10 states. [2018-04-13 10:59:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:40,605 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-04-13 10:59:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 10:59:40,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-13 10:59:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:40,606 INFO L225 Difference]: With dead ends: 72 [2018-04-13 10:59:40,607 INFO L226 Difference]: Without dead ends: 70 [2018-04-13 10:59:40,607 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-13 10:59:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-13 10:59:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-13 10:59:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 10:59:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-04-13 10:59:40,612 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 34 [2018-04-13 10:59:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:40,612 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-04-13 10:59:40,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 10:59:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-04-13 10:59:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 10:59:40,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:40,613 INFO L355 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-13 10:59:40,613 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1743226995, now seen corresponding path program 3 times [2018-04-13 10:59:40,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:40,613 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 10:59:40,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,632 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:40,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:40,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 10:59:40,701 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-13 10:59:40,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 10:59:40,705 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 10:59:40,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-13 10:59:40,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 10:59:40,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 10:59:40,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-13 10:59:40,727 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 12 states. [2018-04-13 10:59:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:40,783 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-04-13 10:59:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 10:59:40,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-04-13 10:59:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:40,784 INFO L225 Difference]: With dead ends: 73 [2018-04-13 10:59:40,784 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 10:59:40,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-13 10:59:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 10:59:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-04-13 10:59:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-13 10:59:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-13 10:59:40,788 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 35 [2018-04-13 10:59:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:40,788 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-13 10:59:40,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 10:59:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-13 10:59:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 10:59:40,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:40,789 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-13 10:59:40,789 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash -357984438, now seen corresponding path program 4 times [2018-04-13 10:59:40,790 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:40,790 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,790 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 10:59:40,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,802 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:40,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:40,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 10:59:40,867 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 10:59:40,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 10:59:40,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:40,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 10:59:40,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-04-13 10:59:40,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 10:59:40,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 10:59:40,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-04-13 10:59:40,926 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 14 states. [2018-04-13 10:59:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:40,966 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-04-13 10:59:40,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 10:59:40,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-04-13 10:59:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:40,972 INFO L225 Difference]: With dead ends: 74 [2018-04-13 10:59:40,972 INFO L226 Difference]: Without dead ends: 72 [2018-04-13 10:59:40,972 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-04-13 10:59:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-13 10:59:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-13 10:59:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-13 10:59:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-13 10:59:40,976 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 36 [2018-04-13 10:59:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:40,976 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-13 10:59:40,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 10:59:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-13 10:59:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 10:59:40,977 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:40,977 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:40,977 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash -365138131, now seen corresponding path program 5 times [2018-04-13 10:59:40,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:40,978 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:40,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 10:59:40,978 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:40,998 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:41,003 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 10:59:41,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:41,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 10:59:41,053 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-13 10:59:41,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 10:59:41,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:41,072 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-04-13 10:59:41,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 10:59:41,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-13 10:59:41,091 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-04-13 10:59:41,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-13 10:59:41,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 10:59:41,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-13 10:59:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,132 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 23 treesize of output 78 [2018-04-13 10:59:41,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-13 10:59:41,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-13 10:59:41,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-04-13 10:59:41,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-13 10:59:41,203 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 48 treesize of output 37 [2018-04-13 10:59:41,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-04-13 10:59:41,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-13 10:59:41,265 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 44 treesize of output 34 [2018-04-13 10:59:41,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:41,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-04-13 10:59:41,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:41,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-13 10:59:42,720 WARN L151 SmtUtils]: Spent 1123ms on a formula simplification. DAG size of input: 157 DAG size of output 72 [2018-04-13 10:59:42,733 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 91 treesize of output 88 [2018-04-13 10:59:42,737 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 48 treesize of output 51 [2018-04-13 10:59:42,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,743 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2018-04-13 10:59:42,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,755 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 0 case distinctions, treesize of input 63 treesize of output 107 [2018-04-13 10:59:42,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 165 [2018-04-13 10:59:42,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 268 [2018-04-13 10:59:42,775 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:42,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:42,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:42,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:42,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:42,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:42,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 345 treesize of output 790 [2018-04-13 10:59:42,953 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 79 DAG size of output 56 [2018-04-13 10:59:42,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:42,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 241 [2018-04-13 10:59:42,966 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 134 [2018-04-13 10:59:43,008 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 149 [2018-04-13 10:59:43,025 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 141 [2018-04-13 10:59:43,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,081 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:43,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 164 [2018-04-13 10:59:43,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,133 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:43,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 187 [2018-04-13 10:59:43,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:43,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2018-04-13 10:59:43,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:43,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 291 [2018-04-13 10:59:43,165 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,203 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,239 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,249 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 122 treesize of output 119 [2018-04-13 10:59:43,266 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 10:59:43,267 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,269 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:43,270 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 79 [2018-04-13 10:59:43,271 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 10:59:43,281 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 10:59:43,288 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 10:59:43,289 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-04-13 10:59:43,289 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,296 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 10:59:43,305 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 10:59:43,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 346 treesize of output 197 [2018-04-13 10:59:43,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 205 [2018-04-13 10:59:43,446 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 8 xjuncts. [2018-04-13 10:59:43,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 176 [2018-04-13 10:59:43,702 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 176 [2018-04-13 10:59:43,704 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 176 [2018-04-13 10:59:43,706 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 180 [2018-04-13 10:59:43,709 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 139 [2018-04-13 10:59:43,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:43,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 165 [2018-04-13 10:59:43,914 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,943 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:43,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 141 [2018-04-13 10:59:44,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 23 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 212 [2018-04-13 10:59:44,040 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,100 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 139 [2018-04-13 10:59:44,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,164 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:44,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 181 [2018-04-13 10:59:44,166 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,187 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 139 [2018-04-13 10:59:44,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:44,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 188 [2018-04-13 10:59:44,222 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,250 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2018-04-13 10:59:44,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 187 [2018-04-13 10:59:44,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 228 [2018-04-13 10:59:44,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 47 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 291 [2018-04-13 10:59:44,535 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,603 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,613 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,623 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2018-04-13 10:59:44,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 136 [2018-04-13 10:59:44,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,692 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:44,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 185 [2018-04-13 10:59:44,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 32 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 239 [2018-04-13 10:59:44,714 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,748 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,756 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,766 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2018-04-13 10:59:44,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,799 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:44,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,800 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:44,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 152 [2018-04-13 10:59:44,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 160 [2018-04-13 10:59:44,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,868 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:44,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 24 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 270 [2018-04-13 10:59:44,869 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,902 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,912 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:44,912 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 51 treesize of output 51 [2018-04-13 10:59:44,913 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,920 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,929 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:44,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2018-04-13 10:59:44,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:44,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 154 [2018-04-13 10:59:45,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 198 [2018-04-13 10:59:45,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 39 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 272 [2018-04-13 10:59:45,056 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,097 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,106 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,118 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,168 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 10:59:45,243 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 6 xjuncts. [2018-04-13 10:59:45,244 INFO L202 ElimStorePlain]: Needed 51 recursive calls to eliminate 2 variables, input treesize:369, output treesize:546 [2018-04-13 10:59:45,426 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 86 DAG size of output 79 [2018-04-13 10:59:45,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 85 [2018-04-13 10:59:45,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 92 [2018-04-13 10:59:45,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 99 [2018-04-13 10:59:45,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 44 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 195 [2018-04-13 10:59:45,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 10:59:45,710 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 98 treesize of output 70 [2018-04-13 10:59:45,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 191 [2018-04-13 10:59:45,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,782 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 88 treesize of output 62 [2018-04-13 10:59:45,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 110 [2018-04-13 10:59:45,790 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,800 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,830 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 93 treesize of output 67 [2018-04-13 10:59:45,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 163 [2018-04-13 10:59:45,836 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,877 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,908 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 98 treesize of output 70 [2018-04-13 10:59:45,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:45,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 139 [2018-04-13 10:59:45,922 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,936 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:45,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 5 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 10:59:45,946 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:499, output treesize:35 [2018-04-13 10:59:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:45,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 10:59:45,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 10:59:45,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 10:59:45,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 10:59:45,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-04-13 10:59:45,974 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 18 states. [2018-04-13 10:59:46,632 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 86 DAG size of output 86 [2018-04-13 10:59:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:46,949 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-04-13 10:59:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 10:59:46,949 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-13 10:59:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:46,950 INFO L225 Difference]: With dead ends: 112 [2018-04-13 10:59:46,950 INFO L226 Difference]: Without dead ends: 112 [2018-04-13 10:59:46,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-04-13 10:59:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-13 10:59:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2018-04-13 10:59:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-13 10:59:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-04-13 10:59:46,953 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 37 [2018-04-13 10:59:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:46,953 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-04-13 10:59:46,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 10:59:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-04-13 10:59:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 10:59:46,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:46,954 INFO L355 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-13 10:59:46,955 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash -586902614, now seen corresponding path program 6 times [2018-04-13 10:59:46,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:46,955 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:46,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:46,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 10:59:46,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:46,966 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:47,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:47,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:47,090 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 10:59:47,116 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-13 10:59:47,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 10:59:47,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:47,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 10:59:47,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-04-13 10:59:47,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 10:59:47,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 10:59:47,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-04-13 10:59:47,210 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 19 states. [2018-04-13 10:59:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:47,489 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-04-13 10:59:47,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 10:59:47,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-04-13 10:59:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:47,489 INFO L225 Difference]: With dead ends: 70 [2018-04-13 10:59:47,489 INFO L226 Difference]: Without dead ends: 67 [2018-04-13 10:59:47,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2018-04-13 10:59:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-13 10:59:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-13 10:59:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 10:59:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-04-13 10:59:47,492 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 38 [2018-04-13 10:59:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:47,492 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-04-13 10:59:47,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 10:59:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-04-13 10:59:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 10:59:47,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:47,492 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:47,492 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash -877857895, now seen corresponding path program 1 times [2018-04-13 10:59:47,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:47,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:47,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:47,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 10:59:47,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:47,507 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:47,511 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 10:59:47,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:47,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:47,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:47,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:47,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 10:59:47,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 10:59:47,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 10:59:47,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 10:59:47,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 10:59:47,593 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-04-13 10:59:47,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-13 10:59:47,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-13 10:59:47,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 37 [2018-04-13 10:59:47,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-13 10:59:47,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-13 10:59:47,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,651 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 25 treesize of output 88 [2018-04-13 10:59:47,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-13 10:59:47,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-04-13 10:59:47,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-04-13 10:59:47,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-04-13 10:59:47,756 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 37 treesize of output 29 [2018-04-13 10:59:47,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:47,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-13 10:59:47,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:47,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-13 10:59:48,285 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 177 DAG size of output 58 [2018-04-13 10:59:48,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 89 [2018-04-13 10:59:48,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-04-13 10:59:48,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,303 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 59 treesize of output 67 [2018-04-13 10:59:48,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,315 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 83 [2018-04-13 10:59:48,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,339 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 2 case distinctions, treesize of input 63 treesize of output 99 [2018-04-13 10:59:48,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 136 [2018-04-13 10:59:48,382 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,395 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-13 10:59:48,456 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:419, output treesize:130 [2018-04-13 10:59:48,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 83 [2018-04-13 10:59:48,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 131 [2018-04-13 10:59:48,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-04-13 10:59:48,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,742 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:48,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 75 [2018-04-13 10:59:48,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 61 [2018-04-13 10:59:48,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-13 10:59:48,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2018-04-13 10:59:48,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,772 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:48,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-04-13 10:59:48,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,781 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:48,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 75 [2018-04-13 10:59:48,789 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 85 [2018-04-13 10:59:48,816 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-04-13 10:59:48,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2018-04-13 10:59:48,829 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-13 10:59:48,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,833 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:48,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 65 [2018-04-13 10:59:48,836 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:48,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,842 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:48,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:48,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 85 [2018-04-13 10:59:48,847 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:49,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-04-13 10:59:49,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-13 10:59:49,104 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:139, output treesize:87 [2018-04-13 10:59:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:49,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 10:59:49,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 10:59:49,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 10:59:49,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 10:59:49,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=340, Unknown=27, NotChecked=0, Total=420 [2018-04-13 10:59:49,175 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 21 states. [2018-04-13 10:59:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 10:59:54,856 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-04-13 10:59:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 10:59:54,857 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-04-13 10:59:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 10:59:54,857 INFO L225 Difference]: With dead ends: 63 [2018-04-13 10:59:54,857 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 10:59:54,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=210, Invalid=1270, Unknown=80, NotChecked=0, Total=1560 [2018-04-13 10:59:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 10:59:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-04-13 10:59:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-13 10:59:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-04-13 10:59:54,860 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 39 [2018-04-13 10:59:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 10:59:54,860 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-04-13 10:59:54,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 10:59:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-04-13 10:59:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 10:59:54,861 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 10:59:54,861 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 10:59:54,862 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 10:59:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash 319688389, now seen corresponding path program 1 times [2018-04-13 10:59:54,862 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 10:59:54,862 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 10:59:54,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:54,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:54,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 10:59:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:54,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 10:59:54,883 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 10:59:54,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 10:59:54,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 10:59:54,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 10:59:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 10:59:54,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 10:59:54,935 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-04-13 10:59:54,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 10:59:54,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:54,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:54,946 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 10:59:54,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 10:59:54,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 10:59:54,964 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-04-13 10:59:54,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-13 10:59:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-13 10:59:54,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:54,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:54,984 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 37 [2018-04-13 10:59:54,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:54,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-13 10:59:55,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-13 10:59:55,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-04-13 10:59:55,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-13 10:59:55,037 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 28 treesize of output 22 [2018-04-13 10:59:55,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 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-04-13 10:59:55,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:7 [2018-04-13 10:59:55,701 WARN L151 SmtUtils]: Spent 395ms on a formula simplification. DAG size of input: 176 DAG size of output 56 [2018-04-13 10:59:55,711 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 89 treesize of output 90 [2018-04-13 10:59:55,714 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 64 treesize of output 67 [2018-04-13 10:59:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 69 [2018-04-13 10:59:55,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 71 [2018-04-13 10:59:55,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,799 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 7 case distinctions, treesize of input 71 treesize of output 99 [2018-04-13 10:59:55,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:55,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 89 treesize of output 160 [2018-04-13 10:59:55,835 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 10:59:55,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-13 10:59:55,897 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:480, output treesize:123 [2018-04-13 10:59:58,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 86 [2018-04-13 10:59:58,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 67 treesize of output 153 [2018-04-13 10:59:58,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2018-04-13 10:59:58,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,331 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-04-13 10:59:58,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2018-04-13 10:59:58,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 69 [2018-04-13 10:59:58,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,346 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2018-04-13 10:59:58,347 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 65 [2018-04-13 10:59:58,366 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-04-13 10:59:58,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,373 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 73 [2018-04-13 10:59:58,378 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-04-13 10:59:58,391 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 87 [2018-04-13 10:59:58,421 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 10:59:58,421 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-04-13 10:59:58,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 58 treesize of output 43 [2018-04-13 10:59:58,425 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-04-13 10:59:58,431 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,436 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 69 [2018-04-13 10:59:58,438 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2018-04-13 10:59:58,448 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 62 [2018-04-13 10:59:58,457 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,462 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2018-04-13 10:59:58,464 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 10:59:58,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-04-13 10:59:58,471 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 10:59:58,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 10:59:58,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 65 [2018-04-13 10:59:58,486 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-04-13 10:59:58,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 10:59:58,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 10:59:58,648 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 8 variables, input treesize:132, output treesize:67 [2018-04-13 10:59:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 10:59:58,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 10:59:58,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 10:59:58,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 10:59:58,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 10:59:58,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=263, Unknown=37, NotChecked=0, Total=342 [2018-04-13 10:59:58,737 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 19 states. [2018-04-13 10:59:59,815 WARN L148 SmtUtils]: Spent 160ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-13 11:00:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:00:00,284 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-04-13 11:00:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 11:00:00,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-04-13 11:00:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:00:00,284 INFO L225 Difference]: With dead ends: 58 [2018-04-13 11:00:00,284 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 11:00:00,285 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=168, Invalid=988, Unknown=104, NotChecked=0, Total=1260 [2018-04-13 11:00:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 11:00:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 11:00:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 11:00:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-04-13 11:00:00,287 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 41 [2018-04-13 11:00:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:00:00,287 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-04-13 11:00:00,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 11:00:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-04-13 11:00:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 11:00:00,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:00:00,288 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:00:00,288 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 11:00:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 110432433, now seen corresponding path program 1 times [2018-04-13 11:00:00,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:00:00,289 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:00:00,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:00:00,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:00:00,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:00:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:00:00,305 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:00:00,309 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:00:00,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:00:00,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:00:00,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:00:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:00:00,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:00:00,343 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-04-13 11:00:00,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 11:00:00,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 11:00:00,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 11:00:00,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 11:00:00,365 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-04-13 11:00:00,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-13 11:00:00,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-13 11:00:00,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,384 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 37 [2018-04-13 11:00:00,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-13 11:00:00,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 11:00:00,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,430 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 15 treesize of output 8 [2018-04-13 11:00:00,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-04-13 11:00:00,832 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 172 DAG size of output 53 [2018-04-13 11:00:00,841 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 80 treesize of output 81 [2018-04-13 11:00:00,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-04-13 11:00:00,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 67 [2018-04-13 11:00:00,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 69 [2018-04-13 11:00:00,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 71 [2018-04-13 11:00:00,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:00,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 71 treesize of output 104 [2018-04-13 11:00:00,955 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,963 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,978 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:00,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-04-13 11:00:01,027 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:465, output treesize:114 [2018-04-13 11:00:01,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 79 [2018-04-13 11:00:01,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 65 treesize of output 105 [2018-04-13 11:00:01,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2018-04-13 11:00:01,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2018-04-13 11:00:01,422 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-13 11:00:01,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-13 11:00:01,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,433 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 11:00:01,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-04-13 11:00:01,445 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2018-04-13 11:00:01,457 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-04-13 11:00:01,460 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 11:00:01,462 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,465 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-04-13 11:00:01,466 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,470 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-04-13 11:00:01,471 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,472 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-04-13 11:00:01,473 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2018-04-13 11:00:01,482 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-13 11:00:01,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,484 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-04-13 11:00:01,486 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,488 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-04-13 11:00:01,490 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-13 11:00:01,497 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,501 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-13 11:00:01,503 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-04-13 11:00:01,510 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,514 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-04-13 11:00:01,516 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,520 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-04-13 11:00:01,524 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,528 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 11:00:01,529 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2018-04-13 11:00:01,548 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-04-13 11:00:01,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,551 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 52 treesize of output 42 [2018-04-13 11:00:01,551 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2018-04-13 11:00:01,568 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-04-13 11:00:01,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:01,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-13 11:00:01,580 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:01,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 78 [2018-04-13 11:00:01,606 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 11:00:01,606 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-04-13 11:00:01,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:01,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 54 [2018-04-13 11:00:01,615 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-04-13 11:00:01,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 11:00:01,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 11:00:01,729 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 9 variables, input treesize:123, output treesize:28 [2018-04-13 11:00:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:00:01,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:00:01,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 11:00:01,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 11:00:01,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 11:00:01,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=234, Unknown=35, NotChecked=0, Total=306 [2018-04-13 11:00:01,789 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 18 states. [2018-04-13 11:00:03,315 WARN L148 SmtUtils]: Spent 292ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-13 11:00:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:00:04,570 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-04-13 11:00:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 11:00:04,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-04-13 11:00:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:00:04,570 INFO L225 Difference]: With dead ends: 53 [2018-04-13 11:00:04,570 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 11:00:04,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=146, Invalid=874, Unknown=102, NotChecked=0, Total=1122 [2018-04-13 11:00:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 11:00:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 11:00:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 11:00:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-04-13 11:00:04,572 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2018-04-13 11:00:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:00:04,572 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-04-13 11:00:04,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 11:00:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-04-13 11:00:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 11:00:04,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:00:04,573 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:00:04,573 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 11:00:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 885632993, now seen corresponding path program 1 times [2018-04-13 11:00:04,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:00:04,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:00:04,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:00:04,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:00:04,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:00:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:00:04,582 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:00:04,584 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:00:04,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:00:04,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:00:04,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:00:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:00:04,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:00:04,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:04,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-13 11:00:04,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,655 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-04-13 11:00:04,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-13 11:00:04,666 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int)) (and (= 0 (select |c_old(#valid)| main_~p~0.base)) (= (store |c_old(#valid)| main_~p~0.base 0) |c_#valid|))) is different from true [2018-04-13 11:00:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-13 11:00:04,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 11:00:04,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 11:00:04,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 11:00:04,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 11:00:04,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2018-04-13 11:00:04,669 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 7 states. [2018-04-13 11:00:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:00:04,771 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2018-04-13 11:00:04,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 11:00:04,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-04-13 11:00:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:00:04,772 INFO L225 Difference]: With dead ends: 54 [2018-04-13 11:00:04,772 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 11:00:04,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-04-13 11:00:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 11:00:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 11:00:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 11:00:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2018-04-13 11:00:04,774 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 45 [2018-04-13 11:00:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:00:04,774 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2018-04-13 11:00:04,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 11:00:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2018-04-13 11:00:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 11:00:04,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 11:00:04,775 INFO L355 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 11:00:04,776 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-13 11:00:04,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1476780718, now seen corresponding path program 1 times [2018-04-13 11:00:04,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 11:00:04,776 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 11:00:04,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:00:04,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:00:04,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 11:00:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:00:04,793 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 11:00:04,801 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 11:00:04,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 11:00:04,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 11:00:04,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 11:00:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 11:00:04,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 11:00:04,829 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-04-13 11:00:04,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 11:00:04,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:04,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 11:00:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 11:00:04,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-13 11:00:04,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 11:00:04,850 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-04-13 11:00:04,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-13 11:00:04,861 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 9 treesize of output 7 [2018-04-13 11:00:04,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 11:00:04,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:04,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-13 11:00:05,965 WARN L151 SmtUtils]: Spent 869ms on a formula simplification. DAG size of input: 169 DAG size of output 50 [2018-04-13 11:00:05,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 72 [2018-04-13 11:00:05,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 63 [2018-04-13 11:00:05,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 65 [2018-04-13 11:00:06,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 67 [2018-04-13 11:00:06,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 67 treesize of output 69 [2018-04-13 11:00:06,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 69 treesize of output 76 [2018-04-13 11:00:06,110 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:06,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:06,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:06,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:06,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:06,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 11:00:06,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-04-13 11:00:06,165 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:454, output treesize:105 [2018-04-13 11:00:06,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2018-04-13 11:00:06,266 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 11:00:06,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 14 case distinctions, treesize of input 61 treesize of output 13 [2018-04-13 11:00:06,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 11:00:06,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 11:00:06,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 11:00:06,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:00:06,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 11:00:06,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:114, output treesize:15 [2018-04-13 11:00:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 11:00:06,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 11:00:06,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 11:00:06,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 11:00:06,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 11:00:06,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=202, Unknown=36, NotChecked=0, Total=272 [2018-04-13 11:00:06,364 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand 17 states. [2018-04-13 11:00:07,466 WARN L148 SmtUtils]: Spent 190ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-13 11:00:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 11:00:08,223 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-04-13 11:00:08,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 11:00:08,223 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-04-13 11:00:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 11:00:08,224 INFO L225 Difference]: With dead ends: 42 [2018-04-13 11:00:08,224 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 11:00:08,224 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=130, Invalid=756, Unknown=106, NotChecked=0, Total=992 [2018-04-13 11:00:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 11:00:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 11:00:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 11:00:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 11:00:08,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-04-13 11:00:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 11:00:08,224 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 11:00:08,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 11:00:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 11:00:08,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 11:00:08,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:00:08 BoogieIcfgContainer [2018-04-13 11:00:08,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 11:00:08,228 INFO L168 Benchmark]: Toolchain (without parser) took 29303.04 ms. Allocated memory was 406.3 MB in the beginning and 828.4 MB in the end (delta: 422.1 MB). Free memory was 345.2 MB in the beginning and 450.4 MB in the end (delta: -105.2 MB). Peak memory consumption was 316.9 MB. Max. memory is 5.3 GB. [2018-04-13 11:00:08,229 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 406.3 MB. Free memory is still 369.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 11:00:08,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.40 ms. Allocated memory is still 406.3 MB. Free memory was 344.7 MB in the beginning and 334.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-13 11:00:08,229 INFO L168 Benchmark]: Boogie Preprocessor took 30.03 ms. Allocated memory is still 406.3 MB. Free memory was 334.1 MB in the beginning and 332.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 11:00:08,229 INFO L168 Benchmark]: RCFGBuilder took 320.83 ms. Allocated memory was 406.3 MB in the beginning and 616.0 MB in the end (delta: 209.7 MB). Free memory was 332.8 MB in the beginning and 569.2 MB in the end (delta: -236.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. [2018-04-13 11:00:08,229 INFO L168 Benchmark]: TraceAbstraction took 28784.86 ms. Allocated memory was 616.0 MB in the beginning and 828.4 MB in the end (delta: 212.3 MB). Free memory was 569.2 MB in the beginning and 450.4 MB in the end (delta: 118.9 MB). Peak memory consumption was 331.2 MB. Max. memory is 5.3 GB. [2018-04-13 11:00:08,230 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 406.3 MB. Free memory is still 369.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.40 ms. Allocated memory is still 406.3 MB. Free memory was 344.7 MB in the beginning and 334.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.03 ms. Allocated memory is still 406.3 MB. Free memory was 334.1 MB in the beginning and 332.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 320.83 ms. Allocated memory was 406.3 MB in the beginning and 616.0 MB in the end (delta: 209.7 MB). Free memory was 332.8 MB in the beginning and 569.2 MB in the end (delta: -236.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 28784.86 ms. Allocated memory was 616.0 MB in the beginning and 828.4 MB in the end (delta: 212.3 MB). Free memory was 569.2 MB in the beginning and 450.4 MB in the end (delta: 118.9 MB). Peak memory consumption was 331.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 22]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 45]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 37 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 37 error locations. SAFE Result, 28.7s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 647 SDtfs, 1071 SDslu, 2471 SDs, 0 SdLazy, 2846 SolverSat, 275 SolverUnsat, 159 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 338 SyntacticMatches, 7 SemanticMatches, 242 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=0, 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 98 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 986 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 684 ConstructedInterpolants, 67 QuantifiedInterpolants, 601321 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1879 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 46/172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_11-00-08-235.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_11-00-08-235.csv Received shutdown request...