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-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 22:20:54,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 22:20:54,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 22:20:54,965 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 22:20:54,965 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 22:20:54,966 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 22:20:54,967 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 22:20:54,969 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 22:20:54,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 22:20:54,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 22:20:54,972 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 22:20:54,972 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 22:20:54,973 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 22:20:54,974 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 22:20:54,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 22:20:54,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 22:20:54,978 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 22:20:54,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 22:20:54,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 22:20:54,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 22:20:54,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 22:20:54,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 22:20:54,985 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 22:20:54,986 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 22:20:54,987 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 22:20:54,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 22:20:54,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 22:20:54,989 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 22:20:54,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 22:20:54,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 22:20:54,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 22:20:54,991 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-09 22:20:55,014 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 22:20:55,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 22:20:55,015 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 22:20:55,015 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 22:20:55,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 22:20:55,016 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 22:20:55,016 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 22:20:55,016 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 22:20:55,017 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 22:20:55,017 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 22:20:55,017 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 22:20:55,017 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 22:20:55,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 22:20:55,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 22:20:55,018 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 22:20:55,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 22:20:55,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 22:20:55,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 22:20:55,019 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 22:20:55,019 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 22:20:55,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 22:20:55,020 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 22:20:55,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 22:20:55,020 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 22:20:55,020 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 22:20:55,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 22:20:55,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 22:20:55,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 22:20:55,021 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 22:20:55,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 22:20:55,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 22:20:55,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 22:20:55,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:20:55,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 22:20:55,023 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 22:20:55,023 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 22:20:55,023 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 22:20:55,023 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 22:20:55,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 22:20:55,070 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 22:20:55,074 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 22:20:55,076 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 22:20:55,076 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 22:20:55,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-09 22:20:55,395 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3a85bd76a [2018-04-09 22:20:55,521 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 22:20:55,521 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 22:20:55,521 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-09 22:20:55,522 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 22:20:55,523 INFO L215 ultiparseSymbolTable]: [2018-04-09 22:20:55,523 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 22:20:55,523 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-09 22:20:55,523 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 22:20:55,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-09 22:20:55,523 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-09 22:20:55,537 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3a85bd76a [2018-04-09 22:20:55,541 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 22:20:55,543 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 22:20:55,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 22:20:55,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 22:20:55,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 22:20:55,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7dc071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55, skipping insertion in model container [2018-04-09 22:20:55,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,567 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:20:55,579 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:20:55,730 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:20:55,764 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:20:55,772 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-09 22:20:55,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55 WrapperNode [2018-04-09 22:20:55,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 22:20:55,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 22:20:55,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 22:20:55,789 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 22:20:55,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (1/1) ... [2018-04-09 22:20:55,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 22:20:55,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 22:20:55,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 22:20:55,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 22:20:55,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (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-09 22:20:55,894 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 22:20:55,895 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 22:20:55,895 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 22:20:55,895 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-09 22:20:55,895 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-09 22:20:55,895 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 22:20:55,895 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 22:20:55,896 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 22:20:55,896 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 22:20:55,896 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-09 22:20:55,896 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 22:20:55,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 22:20:55,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 22:20:55,897 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 22:20:55,897 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 22:20:55,897 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 22:20:56,378 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-09 22:20:56,395 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 22:20:56,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:20:56 BoogieIcfgContainer [2018-04-09 22:20:56,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 22:20:56,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 22:20:56,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 22:20:56,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 22:20:56,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 10:20:55" (1/3) ... [2018-04-09 22:20:56,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d21d589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:20:56, skipping insertion in model container [2018-04-09 22:20:56,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:20:55" (2/3) ... [2018-04-09 22:20:56,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d21d589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:20:56, skipping insertion in model container [2018-04-09 22:20:56,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:20:56" (3/3) ... [2018-04-09 22:20:56,404 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-09 22:20:56,413 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 22:20:56,420 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-09 22:20:56,461 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 22:20:56,462 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 22:20:56,462 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 22:20:56,462 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 22:20:56,462 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 22:20:56,462 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 22:20:56,462 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 22:20:56,463 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 22:20:56,463 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 22:20:56,464 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 22:20:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-04-09 22:20:56,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:20:56,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:56,488 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:20:56,488 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970878, 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-09 22:20:56,507 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:56,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:56,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:20:56,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:56,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:56,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:20:56,617 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-09 22:20:56,618 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:20:56,632 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-09 22:20:56,671 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:20:56,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:20:56,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:20:56,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:20:56,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:20:56,685 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-04-09 22:20:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:20:57,053 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-04-09 22:20:57,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:20:57,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-09 22:20:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:20:57,072 INFO L225 Difference]: With dead ends: 268 [2018-04-09 22:20:57,073 INFO L226 Difference]: Without dead ends: 243 [2018-04-09 22:20:57,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-09 22:20:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-09 22:20:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-09 22:20:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-09 22:20:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-09 22:20:57,130 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-04-09 22:20:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:20:57,131 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-09 22:20:57,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:20:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-09 22:20:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:20:57,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:57,133 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:20:57,133 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970879, 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-09 22:20:57,145 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:57,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:57,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 22:20:57,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:20:57,206 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-09 22:20:57,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,213 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-09 22:20:57,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 22:20:57,223 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-09 22:20:57,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:20:57,262 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-09 22:20:57,285 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:20:57,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 22:20:57,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 22:20:57,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 22:20:57,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 22:20:57,287 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-04-09 22:20:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:20:57,417 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-04-09 22:20:57,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:20:57,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-04-09 22:20:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:20:57,420 INFO L225 Difference]: With dead ends: 233 [2018-04-09 22:20:57,420 INFO L226 Difference]: Without dead ends: 232 [2018-04-09 22:20:57,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-09 22:20:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-09 22:20:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-04-09 22:20:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-09 22:20:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-04-09 22:20:57,433 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-04-09 22:20:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:20:57,433 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-04-09 22:20:57,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 22:20:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-04-09 22:20:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:20:57,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:57,434 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:20:57,435 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970880, 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-09 22:20:57,445 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:57,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:57,471 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-09 22:20:57,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:20:57,490 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-09 22:20:57,490 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:20:57,556 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-09 22:20:57,590 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:20:57,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:20:57,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:20:57,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:20:57,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:20:57,592 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-04-09 22:20:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:20:57,709 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-04-09 22:20:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 22:20:57,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-09 22:20:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:20:57,711 INFO L225 Difference]: With dead ends: 148 [2018-04-09 22:20:57,711 INFO L226 Difference]: Without dead ends: 126 [2018-04-09 22:20:57,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-09 22:20:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-09 22:20:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-09 22:20:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-09 22:20:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-04-09 22:20:57,720 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-04-09 22:20:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:20:57,721 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-04-09 22:20:57,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:20:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-04-09 22:20:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:20:57,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:57,722 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:20:57,722 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970881, 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-09 22:20:57,728 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:57,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:57,746 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-09 22:20:57,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:20:57,809 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-09 22:20:57,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:57,829 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-09 22:20:57,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 22:20:57,842 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-09 22:20:57,842 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:20:58,195 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-09 22:20:58,217 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:20:58,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-09 22:20:58,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:20:58,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:20:58,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-09 22:20:58,219 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-04-09 22:20:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:20:58,265 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-09 22:20:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:20:58,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-09 22:20:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:20:58,267 INFO L225 Difference]: With dead ends: 126 [2018-04-09 22:20:58,267 INFO L226 Difference]: Without dead ends: 125 [2018-04-09 22:20:58,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-09 22:20:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-09 22:20:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-09 22:20:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-09 22:20:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-04-09 22:20:58,278 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-04-09 22:20:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:20:58,278 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-04-09 22:20:58,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:20:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-04-09 22:20:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 22:20:58,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:58,280 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] [2018-04-09 22:20:58,280 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2009038742, 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-09 22:20:58,295 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:58,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:58,361 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-09 22:20:58,361 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:20:58,423 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-09 22:20:58,445 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:20:58,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 22:20:58,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:20:58,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:20:58,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:20:58,446 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-04-09 22:20:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:20:58,477 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-04-09 22:20:58,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:20:58,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-09 22:20:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:20:58,479 INFO L225 Difference]: With dead ends: 230 [2018-04-09 22:20:58,479 INFO L226 Difference]: Without dead ends: 129 [2018-04-09 22:20:58,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 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-09 22:20:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-09 22:20:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-09 22:20:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-09 22:20:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-04-09 22:20:58,487 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-04-09 22:20:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:20:58,488 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-04-09 22:20:58,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:20:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-04-09 22:20:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 22:20:58,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:58,489 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] [2018-04-09 22:20:58,489 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1651014666, 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-09 22:20:58,503 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:58,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:58,556 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-09 22:20:58,557 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:20:58,629 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-09 22:20:58,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:20:58,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-09 22:20:58,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 22:20:58,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 22:20:58,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-09 22:20:58,652 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-04-09 22:20:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:20:58,727 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-09 22:20:58,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 22:20:58,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-09 22:20:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:20:58,729 INFO L225 Difference]: With dead ends: 242 [2018-04-09 22:20:58,729 INFO L226 Difference]: Without dead ends: 141 [2018-04-09 22:20:58,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:20:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-09 22:20:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-09 22:20:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-09 22:20:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-09 22:20:58,738 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-04-09 22:20:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:20:58,739 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-09 22:20:58,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 22:20:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-09 22:20:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 22:20:58,741 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:58,741 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:20:58,741 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash 264713398, 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-09 22:20:58,749 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:58,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:20:58,852 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:20:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:20:59,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:20:59,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-09 22:20:59,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 22:20:59,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 22:20:59,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-04-09 22:20:59,013 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-04-09 22:20:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:20:59,077 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-04-09 22:20:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 22:20:59,077 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-09 22:20:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:20:59,079 INFO L225 Difference]: With dead ends: 254 [2018-04-09 22:20:59,079 INFO L226 Difference]: Without dead ends: 153 [2018-04-09 22:20:59,080 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=197, Unknown=0, NotChecked=0, Total=342 [2018-04-09 22:20:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-09 22:20:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-09 22:20:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-09 22:20:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-04-09 22:20:59,090 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-04-09 22:20:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:20:59,090 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-04-09 22:20:59,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 22:20:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-04-09 22:20:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-09 22:20:59,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:20:59,092 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:20:59,092 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-09 22:20:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1439447690, now seen corresponding path program 3 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-09 22:20:59,102 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:20:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:20:59,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:20:59,150 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-09 22:20:59,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 22:20:59,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-09 22:20:59,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 22:20:59,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,184 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-09 22:20:59,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-09 22:20:59,212 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-09 22:20:59,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-04-09 22:20:59,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-09 22:20:59,252 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-09 22:20:59,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 93 [2018-04-09 22:20:59,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-09 22:20:59,312 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-09 22:20:59,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 132 [2018-04-09 22:20:59,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-09 22:20:59,370 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 57 treesize of output 44 [2018-04-09 22:20:59,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 179 [2018-04-09 22:20:59,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-09 22:20:59,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-04-09 22:20:59,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 234 [2018-04-09 22:20:59,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-09 22:20:59,754 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 62 treesize of output 48 [2018-04-09 22:20:59,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:20:59,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 164 [2018-04-09 22:20:59,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:20:59,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-09 22:21:02,332 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-09 22:21:04,570 WARN L148 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-09 22:21:05,885 WARN L148 SmtUtils]: Spent 253ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-09 22:22:27,831 WARN L151 SmtUtils]: Spent 81876ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-04-09 22:22:28,014 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 146 treesize of output 126 [2018-04-09 22:22:28,023 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 147 treesize of output 149 [2018-04-09 22:22:28,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,039 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 96 treesize of output 114 [2018-04-09 22:22:28,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,057 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:28,058 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 108 treesize of output 139 [2018-04-09 22:22:28,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:28,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 172 [2018-04-09 22:22:28,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:28,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 215 [2018-04-09 22:22:28,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:28,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 266 [2018-04-09 22:22:28,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,256 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:28,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 325 [2018-04-09 22:22:28,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 381 [2018-04-09 22:22:28,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 445 [2018-04-09 22:22:28,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:28,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 544 [2018-04-09 22:22:28,547 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,688 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,749 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,855 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,883 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,907 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,927 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:28,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:29,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:29,186 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-09 22:22:29,186 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-04-09 22:22:29,360 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 185 treesize of output 137 [2018-04-09 22:22:29,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,402 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,415 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,416 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,418 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,425 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:22:29,429 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:22:29,515 INFO L303 Elim1Store]: Index analysis took 148 ms [2018-04-09 22:22:29,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 20 select indices, 20 select index equivalence classes, 53 disjoint index pairs (out of 190 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 566 [2018-04-09 22:22:29,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:22:29,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:29,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:22:29,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-04-09 22:22:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 143 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:22:29,898 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:22:32,933 WARN L148 SmtUtils]: Spent 2490ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-09 22:22:33,132 WARN L148 SmtUtils]: Spent 197ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-09 22:22:33,844 WARN L148 SmtUtils]: Spent 711ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-09 22:22:34,167 WARN L148 SmtUtils]: Spent 321ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-09 22:23:41,453 WARN L148 SmtUtils]: Spent 203ms on a formula simplification that was a NOOP. DAG size: 118 [2018-04-09 22:24:01,219 WARN L148 SmtUtils]: Spent 2058ms on a formula simplification that was a NOOP. DAG size: 121 [2018-04-09 22:24:26,823 WARN L148 SmtUtils]: Spent 2211ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-09 22:24:53,539 WARN L148 SmtUtils]: Spent 2150ms on a formula simplification that was a NOOP. DAG size: 130 [2018-04-09 22:25:35,819 WARN L148 SmtUtils]: Spent 2079ms on a formula simplification that was a NOOP. DAG size: 136 Received shutdown request... [2018-04-09 22:25:40,729 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 22:25:40,730 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 22:25:40,734 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 22:25:40,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 10:25:40 BoogieIcfgContainer [2018-04-09 22:25:40,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 22:25:40,735 INFO L168 Benchmark]: Toolchain (without parser) took 285192.98 ms. Allocated memory was 306.2 MB in the beginning and 530.6 MB in the end (delta: 224.4 MB). Free memory was 248.0 MB in the beginning and 395.2 MB in the end (delta: -147.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:40,736 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 22:25:40,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.66 ms. Allocated memory is still 306.2 MB. Free memory was 248.0 MB in the beginning and 237.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:40,736 INFO L168 Benchmark]: Boogie Preprocessor took 46.45 ms. Allocated memory is still 306.2 MB. Free memory was 237.0 MB in the beginning and 235.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:40,737 INFO L168 Benchmark]: RCFGBuilder took 560.38 ms. Allocated memory was 306.2 MB in the beginning and 471.3 MB in the end (delta: 165.2 MB). Free memory was 235.0 MB in the beginning and 424.0 MB in the end (delta: -189.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:40,737 INFO L168 Benchmark]: TraceAbstraction took 284337.68 ms. Allocated memory was 471.3 MB in the beginning and 530.6 MB in the end (delta: 59.2 MB). Free memory was 424.0 MB in the beginning and 395.2 MB in the end (delta: 28.8 MB). Peak memory consumption was 88.1 MB. Max. memory is 5.3 GB. [2018-04-09 22:25:40,739 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.22 ms. Allocated memory is still 306.2 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.66 ms. Allocated memory is still 306.2 MB. Free memory was 248.0 MB in the beginning and 237.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.45 ms. Allocated memory is still 306.2 MB. Free memory was 237.0 MB in the beginning and 235.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 560.38 ms. Allocated memory was 306.2 MB in the beginning and 471.3 MB in the end (delta: 165.2 MB). Free memory was 235.0 MB in the beginning and 424.0 MB in the end (delta: -189.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284337.68 ms. Allocated memory was 471.3 MB in the beginning and 530.6 MB in the end (delta: 59.2 MB). Free memory was 424.0 MB in the beginning and 395.2 MB in the end (delta: 28.8 MB). Peak memory consumption was 88.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 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 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 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 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 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 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 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 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 284.2s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 750 SDslu, 1125 SDs, 0 SdLazy, 376 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 382 ConstructedInterpolants, 12 QuantifiedInterpolants, 34110 SizeOfPredicates, 12 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/112 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-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_22-25-40-749.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_22-25-40-749.csv Completed graceful shutdown