java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 23:26:01,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 23:26:01,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 23:26:01,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 23:26:01,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 23:26:01,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 23:26:01,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 23:26:01,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 23:26:01,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 23:26:01,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 23:26:01,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 23:26:01,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 23:26:01,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 23:26:01,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 23:26:01,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 23:26:01,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 23:26:01,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 23:26:01,633 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 23:26:01,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 23:26:01,635 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 23:26:01,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 23:26:01,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 23:26:01,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 23:26:01,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 23:26:01,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 23:26:01,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 23:26:01,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 23:26:01,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 23:26:01,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 23:26:01,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 23:26:01,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 23:26:01,644 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 23:26:01,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 23:26:01,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 23:26:01,668 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 23:26:01,669 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 23:26:01,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 23:26:01,669 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 23:26:01,670 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 23:26:01,670 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 23:26:01,670 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 23:26:01,670 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 23:26:01,671 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 23:26:01,671 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 23:26:01,671 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 23:26:01,671 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 23:26:01,671 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 23:26:01,672 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 23:26:01,672 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 23:26:01,672 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 23:26:01,672 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 23:26:01,672 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 23:26:01,672 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 23:26:01,673 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 23:26:01,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 23:26:01,673 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 23:26:01,673 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 23:26:01,673 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 23:26:01,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:26:01,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 23:26:01,674 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 23:26:01,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 23:26:01,674 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 23:26:01,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 23:26:01,675 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:01,675 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 23:26:01,676 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 23:26:01,676 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 23:26:01,676 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 23:26:01,676 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 23:26:01,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 23:26:01,723 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 23:26:01,727 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 23:26:01,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 23:26:01,730 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 23:26:01,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-04-11 23:26:02,057 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG993eaa1e0 [2018-04-11 23:26:02,177 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 23:26:02,178 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 23:26:02,178 INFO L168 CDTParser]: Scanning test-bitfields-2_false-valid-deref.i [2018-04-11 23:26:02,180 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 23:26:02,180 INFO L215 ultiparseSymbolTable]: [2018-04-11 23:26:02,180 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 23:26:02,180 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_false-valid-deref.i [2018-04-11 23:26:02,180 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 23:26:02,181 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-11 23:26:02,181 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-11 23:26:02,198 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG993eaa1e0 [2018-04-11 23:26:02,203 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 23:26:02,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 23:26:02,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 23:26:02,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 23:26:02,215 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 23:26:02,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce380ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02, skipping insertion in model container [2018-04-11 23:26:02,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,239 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:26:02,253 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:26:02,392 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:26:02,420 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:26:02,426 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 23:26:02,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02 WrapperNode [2018-04-11 23:26:02,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 23:26:02,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 23:26:02,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 23:26:02,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 23:26:02,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... [2018-04-11 23:26:02,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 23:26:02,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 23:26:02,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 23:26:02,482 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 23:26:02,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:26:02,542 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 23:26:02,542 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 23:26:02,542 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 23:26:02,542 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 23:26:02,543 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 23:26:02,544 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 23:26:02,544 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 23:26:02,544 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 23:26:02,932 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 23:26:02,964 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 23:26:02,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:26:02 BoogieIcfgContainer [2018-04-11 23:26:02,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 23:26:02,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 23:26:02,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 23:26:02,969 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 23:26:02,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:26:02" (1/3) ... [2018-04-11 23:26:02,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782f39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:26:02, skipping insertion in model container [2018-04-11 23:26:02,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:26:02" (2/3) ... [2018-04-11 23:26:02,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782f39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:26:02, skipping insertion in model container [2018-04-11 23:26:02,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:26:02" (3/3) ... [2018-04-11 23:26:02,973 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-04-11 23:26:02,980 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 23:26:02,987 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-11 23:26:03,030 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 23:26:03,031 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 23:26:03,031 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 23:26:03,031 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 23:26:03,032 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 23:26:03,032 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 23:26:03,032 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 23:26:03,032 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 23:26:03,032 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 23:26:03,033 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 23:26:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-04-11 23:26:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 23:26:03,052 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:03,052 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:26:03,053 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-11 23:26:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash -506314848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:03,068 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:03,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:03,149 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-11 23:26:03,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:03,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:03,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:26:03,178 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-11 23:26:03,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:03,189 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-11 23:26:03,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 23:26:03,203 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-11 23:26:03,203 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:26:03,247 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-11 23:26:03,283 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:26:03,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-11 23:26:03,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 23:26:03,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 23:26:03,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:26:03,304 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-04-11 23:26:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:26:03,467 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-04-11 23:26:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:26:03,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-11 23:26:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:26:03,484 INFO L225 Difference]: With dead ends: 160 [2018-04-11 23:26:03,484 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 23:26:03,488 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:26:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 23:26:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-04-11 23:26:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 23:26:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-04-11 23:26:03,534 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-04-11 23:26:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:26:03,535 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-04-11 23:26:03,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 23:26:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-04-11 23:26:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 23:26:03,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:03,536 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:26:03,536 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-11 23:26:03,537 INFO L82 PathProgramCache]: Analyzing trace with hash -506314847, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:03,548 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:03,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:03,576 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-11 23:26:03,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:03,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:03,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:26:03,609 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-11 23:26:03,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:03,618 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-11 23:26:03,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 23:26:03,624 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-11 23:26:03,624 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:26:03,999 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-11 23:26:04,019 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:26:04,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-11 23:26:04,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 23:26:04,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 23:26:04,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-11 23:26:04,021 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 5 states. [2018-04-11 23:26:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:26:04,099 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-04-11 23:26:04,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:26:04,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 23:26:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:26:04,101 INFO L225 Difference]: With dead ends: 102 [2018-04-11 23:26:04,101 INFO L226 Difference]: Without dead ends: 96 [2018-04-11 23:26:04,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-11 23:26:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-11 23:26:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-11 23:26:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 23:26:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-11 23:26:04,113 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-04-11 23:26:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:26:04,113 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-11 23:26:04,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 23:26:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-11 23:26:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 23:26:04,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:04,115 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] [2018-04-11 23:26:04,115 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-11 23:26:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 51854364, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:04,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:04,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:04,155 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-11 23:26:04,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:04,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:04,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:26:04,199 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-11 23:26:04,200 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:26:04,236 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-11 23:26:04,267 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:26:04,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:26:04,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:26:04,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:26:04,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:26:04,269 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-04-11 23:26:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:26:04,446 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-04-11 23:26:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 23:26:04,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 23:26:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:26:04,448 INFO L225 Difference]: With dead ends: 96 [2018-04-11 23:26:04,448 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 23:26:04,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:26:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 23:26:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-11 23:26:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 23:26:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-11 23:26:04,459 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2018-04-11 23:26:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:26:04,460 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-11 23:26:04,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:26:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-11 23:26:04,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 23:26:04,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:04,461 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] [2018-04-11 23:26:04,461 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-11 23:26:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash 51854362, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:04,480 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:04,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:04,504 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-11 23:26:04,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:04,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:04,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:26:04,537 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-11 23:26:04,537 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:26:04,546 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-11 23:26:04,566 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:26:04,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:26:04,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:26:04,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:26:04,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:26:04,568 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 4 states. [2018-04-11 23:26:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:26:04,650 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-04-11 23:26:04,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:26:04,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-11 23:26:04,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:26:04,652 INFO L225 Difference]: With dead ends: 126 [2018-04-11 23:26:04,652 INFO L226 Difference]: Without dead ends: 114 [2018-04-11 23:26:04,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-11 23:26:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-11 23:26:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2018-04-11 23:26:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 23:26:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-11 23:26:04,659 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-04-11 23:26:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:26:04,660 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-11 23:26:04,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:26:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-11 23:26:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 23:26:04,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:04,661 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, 1, 1, 1, 1] [2018-04-11 23:26:04,661 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-11 23:26:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2075956322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:04,668 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:04,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:04,702 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-11 23:26:04,702 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:26:04,733 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-11 23:26:04,754 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:26:04,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 23:26:04,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:26:04,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:26:04,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:26:04,755 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-04-11 23:26:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:26:04,780 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-04-11 23:26:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:26:04,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-04-11 23:26:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:26:04,786 INFO L225 Difference]: With dead ends: 143 [2018-04-11 23:26:04,786 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 23:26:04,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:26:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 23:26:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-11 23:26:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 23:26:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-11 23:26:04,795 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 37 [2018-04-11 23:26:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:26:04,796 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-11 23:26:04,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:26:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-11 23:26:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 23:26:04,797 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:04,798 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:26:04,798 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-11 23:26:04,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1900445346, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:04,810 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:04,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:26:04,908 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:26:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:26:05,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:26:05,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 23:26:05,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 23:26:05,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 23:26:05,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-11 23:26:05,017 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-04-11 23:26:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:26:05,074 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-04-11 23:26:05,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 23:26:05,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-11 23:26:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:26:05,076 INFO L225 Difference]: With dead ends: 152 [2018-04-11 23:26:05,076 INFO L226 Difference]: Without dead ends: 96 [2018-04-11 23:26:05,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-11 23:26:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-11 23:26:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-04-11 23:26:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 23:26:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-11 23:26:05,085 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2018-04-11 23:26:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:26:05,086 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-11 23:26:05,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 23:26:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-11 23:26:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 23:26:05,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:05,087 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:26:05,088 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-11 23:26:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1778096232, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:05,099 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:05,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:05,164 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-11 23:26:05,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 23:26:05,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-11 23:26:05,182 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-11 23:26:05,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,187 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-11 23:26:05,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 23:26:05,211 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-11 23:26:05,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,220 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-11 23:26:05,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 23:26:05,253 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-11 23:26:05,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,263 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-11 23:26:05,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-11 23:26:05,325 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-11 23:26:05,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,343 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-11 23:26:05,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-11 23:26:05,414 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-11 23:26:05,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:05,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, 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-11 23:26:05,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:05,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-11 23:26:06,630 WARN L151 SmtUtils]: Spent 587ms on a formula simplification. DAG size of input: 161 DAG size of output 40 [2018-04-11 23:26:06,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 81 [2018-04-11 23:26:06,680 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 88 treesize of output 90 [2018-04-11 23:26:06,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,688 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-11 23:26:06,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,700 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-11 23:26:06,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,711 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-11 23:26:06,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:06,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 214 [2018-04-11 23:26:06,752 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:06,797 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:06,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:06,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:06,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:06,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:06,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 23:26:06,986 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:375, output treesize:108 [2018-04-11 23:26:07,054 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 106 treesize of output 82 [2018-04-11 23:26:07,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,064 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:07,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,074 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:07,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,077 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:07,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,078 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:07,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,080 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:07,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:07,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 175 [2018-04-11 23:26:07,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 23:26:07,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:07,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:07,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:7 [2018-04-11 23:26:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:26:07,232 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:26:08,643 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 99 DAG size of output 85 [2018-04-11 23:26:09,300 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-04-11 23:26:10,974 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-04-11 23:26:11,513 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 23:26:11,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:11,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:11,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:552, output treesize:1 [2018-04-11 23:26:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:26:11,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:26:11,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 40 [2018-04-11 23:26:11,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 23:26:11,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 23:26:11,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1305, Unknown=10, NotChecked=0, Total=1560 [2018-04-11 23:26:11,568 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 40 states. [2018-04-11 23:26:16,501 WARN L151 SmtUtils]: Spent 2631ms on a formula simplification. DAG size of input: 200 DAG size of output 146 [2018-04-11 23:26:17,904 WARN L151 SmtUtils]: Spent 701ms on a formula simplification. DAG size of input: 144 DAG size of output 120 [2018-04-11 23:26:21,117 WARN L151 SmtUtils]: Spent 1990ms on a formula simplification. DAG size of input: 180 DAG size of output 151 [2018-04-11 23:26:22,803 WARN L151 SmtUtils]: Spent 874ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-04-11 23:26:25,037 WARN L151 SmtUtils]: Spent 1185ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-04-11 23:26:26,037 WARN L148 SmtUtils]: Spent 359ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-11 23:26:27,579 WARN L151 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-04-11 23:26:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:26:29,357 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-04-11 23:26:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 23:26:29,358 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-04-11 23:26:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:26:29,362 INFO L225 Difference]: With dead ends: 313 [2018-04-11 23:26:29,363 INFO L226 Difference]: Without dead ends: 266 [2018-04-11 23:26:29,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=735, Invalid=4367, Unknown=10, NotChecked=0, Total=5112 [2018-04-11 23:26:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-11 23:26:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 116. [2018-04-11 23:26:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 23:26:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-04-11 23:26:29,381 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 52 [2018-04-11 23:26:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:26:29,381 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-04-11 23:26:29,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 23:26:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-04-11 23:26:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 23:26:29,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:26:29,383 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:26:29,383 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-11 23:26:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash -248522691, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:26:29,393 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:26:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:26:29,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:26:29,441 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-11 23:26:29,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:26:29,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 23:26:29,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 23:26:29,468 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-11 23:26:29,470 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-11 23:26:29,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 23:26:29,488 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-11 23:26:29,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,492 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-11 23:26:29,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 23:26:29,515 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-11 23:26:29,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,520 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-11 23:26:29,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 23:26:29,551 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-11 23:26:29,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,562 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-11 23:26:29,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 23:26:29,612 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-11 23:26:29,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:29,621 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-11 23:26:29,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:29,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-11 23:26:30,323 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 176 DAG size of output 57 [2018-04-11 23:26:30,335 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 96 treesize of output 97 [2018-04-11 23:26:30,340 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-11 23:26:30,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,349 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-11 23:26:30,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 97 [2018-04-11 23:26:30,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 149 [2018-04-11 23:26:30,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 240 [2018-04-11 23:26:30,408 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,437 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 23:26:30,524 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:419, output treesize:130 [2018-04-11 23:26:30,650 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 117 treesize of output 91 [2018-04-11 23:26:30,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:30,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:30,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,674 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:30,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:30,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 249 [2018-04-11 23:26:30,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:26:30,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:26:30,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 87 [2018-04-11 23:26:30,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:26:30,780 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:139, output treesize:3 [2018-04-11 23:26:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:26:30,850 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:27:49,341 WARN L148 SmtUtils]: Spent 2038ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-11 23:29:12,323 WARN L148 SmtUtils]: Spent 360ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-11 23:29:35,326 WARN L148 SmtUtils]: Spent 1181ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-11 23:30:18,361 WARN L148 SmtUtils]: Spent 10394ms on a formula simplification that was a NOOP. DAG size: 96 Received shutdown request... [2018-04-11 23:30:47,330 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 23:30:47,330 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 23:30:47,335 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 23:30:47,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:30:47 BoogieIcfgContainer [2018-04-11 23:30:47,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 23:30:47,336 INFO L168 Benchmark]: Toolchain (without parser) took 285131.85 ms. Allocated memory was 301.5 MB in the beginning and 556.3 MB in the end (delta: 254.8 MB). Free memory was 245.0 MB in the beginning and 522.3 MB in the end (delta: -277.3 MB). Peak memory consumption was 208.8 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:47,337 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 301.5 MB. Free memory is still 263.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 23:30:47,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.46 ms. Allocated memory is still 301.5 MB. Free memory was 245.0 MB in the beginning and 233.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:47,338 INFO L168 Benchmark]: Boogie Preprocessor took 39.90 ms. Allocated memory is still 301.5 MB. Free memory was 233.6 MB in the beginning and 231.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:47,338 INFO L168 Benchmark]: RCFGBuilder took 483.64 ms. Allocated memory was 301.5 MB in the beginning and 461.9 MB in the end (delta: 160.4 MB). Free memory was 231.6 MB in the beginning and 420.3 MB in the end (delta: -188.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:47,339 INFO L168 Benchmark]: TraceAbstraction took 284369.09 ms. Allocated memory was 461.9 MB in the beginning and 556.3 MB in the end (delta: 94.4 MB). Free memory was 419.0 MB in the beginning and 522.3 MB in the end (delta: -103.3 MB). Peak memory consumption was 222.4 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:47,341 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.21 ms. Allocated memory is still 301.5 MB. Free memory is still 263.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.46 ms. Allocated memory is still 301.5 MB. Free memory was 245.0 MB in the beginning and 233.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.90 ms. Allocated memory is still 301.5 MB. Free memory was 233.6 MB in the beginning and 231.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 483.64 ms. Allocated memory was 301.5 MB in the beginning and 461.9 MB in the end (delta: 160.4 MB). Free memory was 231.6 MB in the beginning and 420.3 MB in the end (delta: -188.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284369.09 ms. Allocated memory was 461.9 MB in the beginning and 556.3 MB in the end (delta: 94.4 MB). Free memory was 419.0 MB in the beginning and 522.3 MB in the end (delta: -103.3 MB). Peak memory consumption was 222.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 40 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 284.3s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 18.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 1931 SDslu, 1358 SDs, 0 SdLazy, 1286 SolverSat, 368 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 335 SyntacticMatches, 10 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=7, 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, 7 MinimizatonAttempts, 230 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 44 QuantifiedInterpolants, 986432 SizeOfPredicates, 21 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_23-30-47-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_23-30-47-351.csv Completed graceful shutdown