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_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 22:25:47,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 22:25:47,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 22:25:47,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 22:25:47,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 22:25:47,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 22:25:47,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 22:25:47,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 22:25:47,876 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 22:25:47,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 22:25:47,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 22:25:47,878 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 22:25:47,879 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 22:25:47,880 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 22:25:47,881 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 22:25:47,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 22:25:47,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 22:25:47,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 22:25:47,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 22:25:47,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 22:25:47,891 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 22:25:47,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 22:25:47,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 22:25:47,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 22:25:47,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 22:25:47,894 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 22:25:47,894 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 22:25:47,895 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 22:25:47,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 22:25:47,896 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 22:25:47,896 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 22:25:47,897 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:25:47,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 22:25:47,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 22:25:47,921 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 22:25:47,921 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 22:25:47,922 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 22:25:47,922 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 22:25:47,922 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 22:25:47,922 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 22:25:47,923 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 22:25:47,923 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 22:25:47,923 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 22:25:47,923 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 22:25:47,924 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 22:25:47,924 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 22:25:47,924 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 22:25:47,924 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 22:25:47,924 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 22:25:47,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 22:25:47,925 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 22:25:47,925 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 22:25:47,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 22:25:47,925 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 22:25:47,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 22:25:47,926 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 22:25:47,926 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 22:25:47,926 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 22:25:47,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 22:25:47,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 22:25:47,927 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 22:25:47,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 22:25:47,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 22:25:47,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 22:25:47,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:47,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 22:25:47,928 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 22:25:47,929 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 22:25:47,929 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 22:25:47,929 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 22:25:47,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 22:25:47,973 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 22:25:47,977 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 22:25:47,978 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 22:25:47,978 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 22:25:47,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i [2018-04-09 22:25:48,293 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd87da15cd [2018-04-09 22:25:48,451 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 22:25:48,451 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 22:25:48,451 INFO L168 CDTParser]: Scanning test-bitfields-3_false-valid-deref.i [2018-04-09 22:25:48,452 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 22:25:48,452 INFO L215 ultiparseSymbolTable]: [2018-04-09 22:25:48,453 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 22:25:48,453 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_false-valid-deref.i [2018-04-09 22:25:48,453 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 22:25:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-3_false-valid-deref.i [2018-04-09 22:25:48,453 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-3_false-valid-deref.i [2018-04-09 22:25:48,467 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd87da15cd [2018-04-09 22:25:48,471 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 22:25:48,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 22:25:48,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 22:25:48,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 22:25:48,480 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 22:25:48,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27aca0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48, skipping insertion in model container [2018-04-09 22:25:48,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,495 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:25:48,508 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:25:48,628 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:25:48,658 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:25:48,664 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-09 22:25:48,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48 WrapperNode [2018-04-09 22:25:48,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 22:25:48,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 22:25:48,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 22:25:48,680 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 22:25:48,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (1/1) ... [2018-04-09 22:25:48,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 22:25:48,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 22:25:48,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 22:25:48,719 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 22:25:48,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (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:25:48,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 22:25:48,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 22:25:48,776 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 22:25:48,776 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-09 22:25:48,776 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-09 22:25:48,776 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 22:25:48,776 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 22:25:48,776 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 22:25:48,777 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 22:25:48,777 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-09 22:25:48,777 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 22:25:48,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 22:25:48,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 22:25:48,777 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 22:25:48,778 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 22:25:48,778 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 22:25:49,302 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-09 22:25:49,332 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 22:25:49,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:25:49 BoogieIcfgContainer [2018-04-09 22:25:49,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 22:25:49,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 22:25:49,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 22:25:49,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 22:25:49,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 10:25:48" (1/3) ... [2018-04-09 22:25:49,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102f202f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:25:49, skipping insertion in model container [2018-04-09 22:25:49,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:48" (2/3) ... [2018-04-09 22:25:49,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102f202f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:25:49, skipping insertion in model container [2018-04-09 22:25:49,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:25:49" (3/3) ... [2018-04-09 22:25:49,341 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i [2018-04-09 22:25:49,349 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 22:25:49,356 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-09 22:25:49,398 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 22:25:49,399 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 22:25:49,399 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 22:25:49,399 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 22:25:49,399 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 22:25:49,399 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 22:25:49,399 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 22:25:49,399 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 22:25:49,400 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 22:25:49,400 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 22:25:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-04-09 22:25:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:25:49,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:49,424 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:25:49,424 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:25:49,428 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:25:49,443 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:49,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:49,547 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:25:49,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:49,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:49,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:25:49,576 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:25:49,577 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:49,592 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:25:49,629 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:49,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:25:49,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:25:49,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:25:49,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:25:49,643 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-04-09 22:25:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:49,997 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-04-09 22:25:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:25:49,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-09 22:25:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:50,013 INFO L225 Difference]: With dead ends: 268 [2018-04-09 22:25:50,013 INFO L226 Difference]: Without dead ends: 243 [2018-04-09 22:25:50,017 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:25:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-09 22:25:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-09 22:25:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-09 22:25:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-09 22:25:50,064 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-04-09 22:25:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:50,065 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-09 22:25:50,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:25:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-09 22:25:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:25:50,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:50,066 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:25:50,066 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:25:50,067 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:25:50,078 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:50,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:50,105 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:25:50,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:25:50,134 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:25:50,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,138 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:25:50,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 22:25:50,152 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:25:50,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:50,175 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:25:50,198 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:50,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 22:25:50,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 22:25:50,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 22:25:50,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 22:25:50,200 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-04-09 22:25:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:50,329 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-04-09 22:25:50,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:25:50,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-04-09 22:25:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:50,332 INFO L225 Difference]: With dead ends: 233 [2018-04-09 22:25:50,332 INFO L226 Difference]: Without dead ends: 232 [2018-04-09 22:25:50,333 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:25:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-09 22:25:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-04-09 22:25:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-09 22:25:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-04-09 22:25:50,348 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-04-09 22:25:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:50,349 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-04-09 22:25:50,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 22:25:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-04-09 22:25:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:25:50,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:50,350 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:25:50,350 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:25:50,350 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:25:50,366 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:50,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:50,392 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:25:50,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:25:50,415 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:25:50,415 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:50,459 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:25:50,493 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:50,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:25:50,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:25:50,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:25:50,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:25:50,495 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-04-09 22:25:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:50,706 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-04-09 22:25:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 22:25:50,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-09 22:25:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:50,708 INFO L225 Difference]: With dead ends: 148 [2018-04-09 22:25:50,709 INFO L226 Difference]: Without dead ends: 126 [2018-04-09 22:25:50,709 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:25:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-09 22:25:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-09 22:25:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-09 22:25:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-04-09 22:25:50,719 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-04-09 22:25:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:50,720 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-04-09 22:25:50,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:25:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-04-09 22:25:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-09 22:25:50,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:50,721 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:25:50,721 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:25:50,721 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:25:50,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:50,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:50,757 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:25:50,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:25:50,773 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:25:50,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:50,780 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:25:50,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-09 22:25:50,785 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:25:50,785 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:51,104 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:25:51,126 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:51,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-09 22:25:51,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 22:25:51,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 22:25:51,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-09 22:25:51,127 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-04-09 22:25:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:51,209 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-09 22:25:51,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:25:51,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-09 22:25:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:51,211 INFO L225 Difference]: With dead ends: 126 [2018-04-09 22:25:51,211 INFO L226 Difference]: Without dead ends: 125 [2018-04-09 22:25:51,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-09 22:25:51,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-09 22:25:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-09 22:25:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-09 22:25:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-04-09 22:25:51,222 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-04-09 22:25:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:51,222 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-04-09 22:25:51,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 22:25:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-04-09 22:25:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 22:25:51,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:51,224 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:25:51,224 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:25:51,224 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:25:51,235 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:51,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:51,281 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:25:51,282 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:51,372 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:25:51,403 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:51,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 22:25:51,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:25:51,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:25:51,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:25:51,405 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-04-09 22:25:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:51,474 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-04-09 22:25:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:25:51,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-09 22:25:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:51,476 INFO L225 Difference]: With dead ends: 230 [2018-04-09 22:25:51,476 INFO L226 Difference]: Without dead ends: 129 [2018-04-09 22:25:51,477 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:25:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-09 22:25:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-09 22:25:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-09 22:25:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-04-09 22:25:51,485 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-04-09 22:25:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:51,485 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-04-09 22:25:51,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:25:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-04-09 22:25:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 22:25:51,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:51,487 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:25:51,487 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:25:51,487 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:25:51,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:51,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:51,561 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:25:51,562 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:51,624 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:25:51,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:25:51,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-09 22:25:51,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 22:25:51,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 22:25:51,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-09 22:25:51,647 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-04-09 22:25:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:51,691 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-09 22:25:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 22:25:51,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-09 22:25:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:51,693 INFO L225 Difference]: With dead ends: 242 [2018-04-09 22:25:51,694 INFO L226 Difference]: Without dead ends: 141 [2018-04-09 22:25:51,694 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:25:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-09 22:25:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-09 22:25:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-09 22:25:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-09 22:25:51,703 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-04-09 22:25:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:51,703 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-09 22:25:51,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 22:25:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-09 22:25:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 22:25:51,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:51,705 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:25:51,705 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:25:51,706 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:25:51,712 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:51,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:51,776 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:25:51,776 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:51,905 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:25:51,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:25:51,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-09 22:25:51,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-09 22:25:51,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-09 22:25:51,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-04-09 22:25:51,928 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-04-09 22:25:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:51,996 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-04-09 22:25:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 22:25:51,998 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-09 22:25:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:51,999 INFO L225 Difference]: With dead ends: 254 [2018-04-09 22:25:51,999 INFO L226 Difference]: Without dead ends: 153 [2018-04-09 22:25:52,000 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:25:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-09 22:25:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-09 22:25:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-09 22:25:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-04-09 22:25:52,007 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-04-09 22:25:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:52,007 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-04-09 22:25:52,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-09 22:25:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-04-09 22:25:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-09 22:25:52,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:52,009 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:25:52,010 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:25:52,010 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:25:52,025 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:52,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:52,085 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:25:52,087 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:25:52,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-09 22:25:52,100 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:25:52,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,104 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:25:52,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-09 22:25:52,123 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:25:52,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,128 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:25:52,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-09 22:25:52,153 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:25:52,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,161 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:25:52,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-09 22:25:52,227 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:25:52,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,238 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:25:52,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-09 22:25:52,281 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:25:52,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,302 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:25:52,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-09 22:25:52,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:25:52,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,503 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:25:52,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-09 22:25:52,654 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:25:52,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,675 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:25:52,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-09 22:25:54,291 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-09 22:25:55,230 WARN L148 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-09 22:25:56,509 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-09 22:25:57,476 WARN L148 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-09 22:25:59,063 WARN L148 SmtUtils]: Spent 242ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-09 22:28:50,927 WARN L151 SmtUtils]: Spent 171800ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-04-09 22:28:51,135 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:28:51,143 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:28:51,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,162 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:28:51,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,178 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:51,179 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:28:51,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,208 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:51,209 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:28:51,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,242 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:51,243 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:28:51,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,308 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:51,309 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:28:51,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:51,367 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:28:51,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,478 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-04-09 22:28:51,479 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:28:51,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,583 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:28:51,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:51,687 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:28:51,688 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 22:28:51,841 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:51,913 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:51,979 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,045 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,070 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,090 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,280 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:28:52,281 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-04-09 22:28:52,526 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:28:52,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,560 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,575 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,588 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,589 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,600 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:28:52,602 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:28:52,680 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-04-09 22:28:52,683 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:28:52,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:28:52,874 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:28:52,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-04-09 22:28:53,097 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:28:53,098 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:28:56,545 WARN L148 SmtUtils]: Spent 2850ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-09 22:28:56,780 WARN L148 SmtUtils]: Spent 233ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-09 22:28:57,188 WARN L148 SmtUtils]: Spent 407ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-09 22:28:57,468 WARN L148 SmtUtils]: Spent 278ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-09 22:30:20,753 WARN L148 SmtUtils]: Spent 2691ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-09 22:30:20,759 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 Received shutdown request... [2018-04-09 22:30:34,139 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 22:30:34,139 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 22:30:34,144 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 22:30:34,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 10:30:34 BoogieIcfgContainer [2018-04-09 22:30:34,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 22:30:34,145 INFO L168 Benchmark]: Toolchain (without parser) took 285673.34 ms. Allocated memory was 303.0 MB in the beginning and 522.2 MB in the end (delta: 219.2 MB). Free memory was 245.5 MB in the beginning and 327.2 MB in the end (delta: -81.6 MB). Peak memory consumption was 137.5 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:34,146 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 22:30:34,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.39 ms. Allocated memory is still 303.0 MB. Free memory was 245.5 MB in the beginning and 234.5 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:30:34,147 INFO L168 Benchmark]: Boogie Preprocessor took 39.30 ms. Allocated memory is still 303.0 MB. Free memory was 234.5 MB in the beginning and 232.5 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:30:34,147 INFO L168 Benchmark]: RCFGBuilder took 614.08 ms. Allocated memory was 303.0 MB in the beginning and 461.9 MB in the end (delta: 158.9 MB). Free memory was 232.5 MB in the beginning and 414.4 MB in the end (delta: -181.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:34,148 INFO L168 Benchmark]: TraceAbstraction took 284810.40 ms. Allocated memory was 461.9 MB in the beginning and 522.2 MB in the end (delta: 60.3 MB). Free memory was 414.4 MB in the beginning and 327.2 MB in the end (delta: 87.3 MB). Peak memory consumption was 147.6 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:34,151 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.39 ms. Allocated memory is still 303.0 MB. Free memory was 245.5 MB in the beginning and 234.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.30 ms. Allocated memory is still 303.0 MB. Free memory was 234.5 MB in the beginning and 232.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 614.08 ms. Allocated memory was 303.0 MB in the beginning and 461.9 MB in the end (delta: 158.9 MB). Free memory was 232.5 MB in the beginning and 414.4 MB in the end (delta: -181.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284810.40 ms. Allocated memory was 461.9 MB in the beginning and 522.2 MB in the end (delta: 60.3 MB). Free memory was 414.4 MB in the beginning and 327.2 MB in the end (delta: 87.3 MB). Peak memory consumption was 147.6 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 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 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 284.7s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 1.0s 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s 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.0s SatisfiabilityAnalysisTime, 1.0s 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_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_22-30-34-161.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_22-30-34-161.csv Completed graceful shutdown