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-1cf7e2d-m [2018-03-29 21:37:57,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 21:37:57,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 21:37:57,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 21:37:57,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 21:37:57,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 21:37:57,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 21:37:57,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 21:37:57,781 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 21:37:57,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 21:37:57,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 21:37:57,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 21:37:57,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 21:37:57,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 21:37:57,786 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 21:37:57,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 21:37:57,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 21:37:57,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 21:37:57,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 21:37:57,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 21:37:57,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 21:37:57,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 21:37:57,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 21:37:57,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 21:37:57,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 21:37:57,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 21:37:57,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 21:37:57,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 21:37:57,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 21:37:57,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 21:37:57,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 21:37:57,803 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-03-29 21:37:57,827 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 21:37:57,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 21:37:57,828 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 21:37:57,828 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 21:37:57,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 21:37:57,829 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 21:37:57,829 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 21:37:57,830 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 21:37:57,830 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 21:37:57,830 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 21:37:57,830 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 21:37:57,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 21:37:57,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 21:37:57,831 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 21:37:57,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 21:37:57,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 21:37:57,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 21:37:57,832 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 21:37:57,832 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 21:37:57,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 21:37:57,832 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 21:37:57,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 21:37:57,833 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 21:37:57,833 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 21:37:57,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 21:37:57,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:37:57,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 21:37:57,834 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 21:37:57,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 21:37:57,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 21:37:57,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 21:37:57,835 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:37:57,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 21:37:57,836 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 21:37:57,836 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 21:37:57,836 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 21:37:57,836 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 21:37:57,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 21:37:57,882 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 21:37:57,886 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 21:37:57,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 21:37:57,888 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 21:37:57,889 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-03-29 21:37:58,218 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG79028cec6 [2018-03-29 21:37:58,347 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 21:37:58,348 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 21:37:58,348 INFO L168 CDTParser]: Scanning test-bitfields-3_false-valid-deref.i [2018-03-29 21:37:58,350 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 21:37:58,350 INFO L215 ultiparseSymbolTable]: [2018-03-29 21:37:58,350 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 21:37:58,350 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_false-valid-deref.i [2018-03-29 21:37:58,350 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 21:37:58,351 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-03-29 21:37:58,351 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-03-29 21:37:58,366 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG79028cec6 [2018-03-29 21:37:58,372 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 21:37:58,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 21:37:58,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 21:37:58,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 21:37:58,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 21:37:58,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20683908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58, skipping insertion in model container [2018-03-29 21:37:58,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,402 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:37:58,417 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:37:58,565 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:37:58,597 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:37:58,603 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-29 21:37:58,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58 WrapperNode [2018-03-29 21:37:58,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 21:37:58,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 21:37:58,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 21:37:58,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 21:37:58,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (1/1) ... [2018-03-29 21:37:58,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 21:37:58,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 21:37:58,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 21:37:58,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 21:37:58,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (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-03-29 21:37:58,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 21:37:58,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 21:37:58,724 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 21:37:58,724 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-29 21:37:58,725 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-29 21:37:58,725 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 21:37:58,725 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 21:37:58,725 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 21:37:58,725 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 21:37:58,725 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-29 21:37:58,726 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 21:37:58,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 21:37:58,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 21:37:58,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 21:37:58,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 21:37:58,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 21:37:59,167 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-29 21:37:59,180 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 21:37:59,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:37:59 BoogieIcfgContainer [2018-03-29 21:37:59,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 21:37:59,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 21:37:59,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 21:37:59,185 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 21:37:59,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 09:37:58" (1/3) ... [2018-03-29 21:37:59,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7564324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:37:59, skipping insertion in model container [2018-03-29 21:37:59,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:37:58" (2/3) ... [2018-03-29 21:37:59,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7564324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:37:59, skipping insertion in model container [2018-03-29 21:37:59,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:37:59" (3/3) ... [2018-03-29 21:37:59,187 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i [2018-03-29 21:37:59,194 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 21:37:59,199 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-03-29 21:37:59,235 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 21:37:59,236 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 21:37:59,236 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 21:37:59,236 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 21:37:59,236 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 21:37:59,236 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 21:37:59,236 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 21:37:59,237 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 21:37:59,237 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 21:37:59,237 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 21:37:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-03-29 21:37:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:37:59,258 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:37:59,258 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:37:59,258 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-03-29 21:37:59,261 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-03-29 21:37:59,272 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:37:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:37:59,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:37:59,351 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-03-29 21:37:59,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:37:59,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:37:59,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:37:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:37:59,380 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:37:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:37:59,434 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:37:59,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:37:59,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:37:59,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:37:59,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:37:59,455 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-03-29 21:37:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:37:59,811 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-03-29 21:37:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:37:59,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-03-29 21:37:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:37:59,834 INFO L225 Difference]: With dead ends: 268 [2018-03-29 21:37:59,834 INFO L226 Difference]: Without dead ends: 243 [2018-03-29 21:37:59,838 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-03-29 21:37:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-03-29 21:37:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-03-29 21:37:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-03-29 21:37:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-03-29 21:37:59,893 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-03-29 21:37:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:37:59,894 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-03-29 21:37:59,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:37:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-03-29 21:37:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:37:59,896 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:37:59,896 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:37:59,896 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-03-29 21:37:59,896 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-03-29 21:37:59,910 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:37:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:37:59,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:37:59,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:37:59,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:37:59,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:37:59,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:37:59,972 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-03-29 21:37:59,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:37:59,980 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-03-29 21:37:59,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-29 21:37:59,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:37:59,994 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:00,045 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:00,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 21:38:00,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 21:38:00,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 21:38:00,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 21:38:00,048 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-03-29 21:38:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:00,159 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-03-29 21:38:00,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:38:00,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-03-29 21:38:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:00,162 INFO L225 Difference]: With dead ends: 233 [2018-03-29 21:38:00,163 INFO L226 Difference]: Without dead ends: 232 [2018-03-29 21:38:00,164 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-03-29 21:38:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-03-29 21:38:00,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-03-29 21:38:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-03-29 21:38:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-03-29 21:38:00,178 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-03-29 21:38:00,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:00,178 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-03-29 21:38:00,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 21:38:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-03-29 21:38:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:38:00,179 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:00,179 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:00,180 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-03-29 21:38:00,180 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-03-29 21:38:00,195 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:00,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:00,221 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-03-29 21:38:00,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:00,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:00,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:38:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:00,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:00,324 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:00,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:38:00,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:38:00,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:38:00,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:38:00,326 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-03-29 21:38:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:00,435 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-03-29 21:38:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 21:38:00,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-03-29 21:38:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:00,438 INFO L225 Difference]: With dead ends: 148 [2018-03-29 21:38:00,438 INFO L226 Difference]: Without dead ends: 126 [2018-03-29 21:38:00,438 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-03-29 21:38:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-03-29 21:38:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-03-29 21:38:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-03-29 21:38:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-03-29 21:38:00,449 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-03-29 21:38:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:00,450 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-03-29 21:38:00,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:38:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-03-29 21:38:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:38:00,451 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:00,451 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:00,451 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-03-29 21:38:00,451 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-03-29 21:38:00,458 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:00,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:00,481 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-03-29 21:38:00,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:00,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:00,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:38:00,500 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-03-29 21:38:00,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:00,510 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-03-29 21:38:00,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-03-29 21:38:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:00,524 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:00,892 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:00,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-03-29 21:38:00,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 21:38:00,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 21:38:00,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-29 21:38:00,894 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-03-29 21:38:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:00,942 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-03-29 21:38:00,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:38:00,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-03-29 21:38:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:00,944 INFO L225 Difference]: With dead ends: 126 [2018-03-29 21:38:00,944 INFO L226 Difference]: Without dead ends: 125 [2018-03-29 21:38:00,945 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-03-29 21:38:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-03-29 21:38:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-03-29 21:38:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-03-29 21:38:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-03-29 21:38:00,958 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-03-29 21:38:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:00,959 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-03-29 21:38:00,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 21:38:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-03-29 21:38:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-29 21:38:00,960 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:00,960 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-03-29 21:38:00,960 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-03-29 21:38:00,961 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-03-29 21:38:00,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:01,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:01,023 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:01,110 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:01,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-29 21:38:01,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:38:01,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:38:01,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:38:01,111 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-03-29 21:38:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:01,161 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-03-29 21:38:01,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 21:38:01,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-03-29 21:38:01,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:01,163 INFO L225 Difference]: With dead ends: 230 [2018-03-29 21:38:01,164 INFO L226 Difference]: Without dead ends: 129 [2018-03-29 21:38:01,165 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-03-29 21:38:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-03-29 21:38:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-03-29 21:38:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-03-29 21:38:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-03-29 21:38:01,173 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-03-29 21:38:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:01,174 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-03-29 21:38:01,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:38:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-03-29 21:38:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 21:38:01,175 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:01,175 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-03-29 21:38:01,175 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-03-29 21:38:01,176 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-03-29 21:38:01,187 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:01,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:01,248 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:01,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:38:01,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-29 21:38:01,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 21:38:01,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 21:38:01,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-03-29 21:38:01,336 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-03-29 21:38:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:01,399 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-03-29 21:38:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 21:38:01,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-03-29 21:38:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:01,401 INFO L225 Difference]: With dead ends: 242 [2018-03-29 21:38:01,401 INFO L226 Difference]: Without dead ends: 141 [2018-03-29 21:38:01,401 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-03-29 21:38:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-03-29 21:38:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-03-29 21:38:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-03-29 21:38:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-03-29 21:38:01,410 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-03-29 21:38:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:01,410 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-03-29 21:38:01,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 21:38:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-03-29 21:38:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 21:38:01,412 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:01,412 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-03-29 21:38:01,413 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-03-29 21:38:01,413 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-03-29 21:38:01,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:01,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:01,480 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:01,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:38:01,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-03-29 21:38:01,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-29 21:38:01,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-29 21:38:01,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-03-29 21:38:01,626 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-03-29 21:38:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:01,694 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-03-29 21:38:01,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 21:38:01,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-03-29 21:38:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:01,699 INFO L225 Difference]: With dead ends: 254 [2018-03-29 21:38:01,699 INFO L226 Difference]: Without dead ends: 153 [2018-03-29 21:38:01,700 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-03-29 21:38:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-03-29 21:38:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-03-29 21:38:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-03-29 21:38:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-03-29 21:38:01,709 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-03-29 21:38:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:01,710 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-03-29 21:38:01,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-29 21:38:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-03-29 21:38:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-03-29 21:38:01,712 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:01,712 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-03-29 21:38:01,712 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-03-29 21:38:01,713 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-03-29 21:38:01,723 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:01,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:01,790 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-03-29 21:38:01,792 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-03-29 21:38:01,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-03-29 21:38:01,806 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-03-29 21:38:01,808 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,809 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,810 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-03-29 21:38:01,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-03-29 21:38:01,837 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-03-29 21:38:01,840 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,841 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,841 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,842 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,843 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-03-29 21:38:01,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-03-29 21:38:01,870 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-03-29 21:38:01,873 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,874 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,875 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,876 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,876 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,877 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,879 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,880 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-03-29 21:38:01,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-03-29 21:38:01,914 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-03-29 21:38:01,918 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,918 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,919 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,919 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,920 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,921 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,921 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,922 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,923 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,923 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,924 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,925 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-03-29 21:38:01,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:01,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-03-29 21:38:01,976 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-03-29 21:38:01,980 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,981 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,982 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,982 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,983 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,983 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,984 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,985 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,985 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,986 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,986 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,987 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,988 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,988 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,989 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,989 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:01,990 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-03-29 21:38:01,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-03-29 21:38:02,096 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-03-29 21:38:02,101 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,102 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,114 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,116 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,117 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,118 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,119 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,122 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,123 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,125 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,126 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,139 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,140 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,141 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,142 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,143 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,144 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,145 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,151 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,156 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,160 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,161 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,163 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-03-29 21:38:02,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-03-29 21:38:02,369 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-03-29 21:38:02,375 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,377 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,378 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,378 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,379 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,380 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,380 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,381 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,382 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,382 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,383 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,383 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,384 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,385 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,385 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,386 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,387 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,387 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,389 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,390 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,391 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-03-29 21:38:02,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-03-29 21:38:03,983 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 61 [2018-03-29 21:38:04,934 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 68 [2018-03-29 21:38:06,195 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 79 [2018-03-29 21:38:07,155 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 82 [2018-03-29 21:38:08,722 WARN L148 SmtUtils]: Spent 242ms on a formula simplification that was a NOOP. DAG size: 88 Received shutdown request... [2018-03-29 21:40:47,531 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-29 21:40:47,532 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 21:40:47,537 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 21:40:47,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 09:40:47 BoogieIcfgContainer [2018-03-29 21:40:47,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 21:40:47,538 INFO L168 Benchmark]: Toolchain (without parser) took 169165.81 ms. Allocated memory was 299.9 MB in the beginning and 536.9 MB in the end (delta: 237.0 MB). Free memory was 243.4 MB in the beginning and 362.3 MB in the end (delta: -118.9 MB). Peak memory consumption was 158.4 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:47,539 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 299.9 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 21:40:47,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.97 ms. Allocated memory is still 299.9 MB. Free memory was 241.4 MB in the beginning and 231.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:47,540 INFO L168 Benchmark]: Boogie Preprocessor took 41.98 ms. Allocated memory is still 299.9 MB. Free memory was 231.4 MB in the beginning and 229.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:47,540 INFO L168 Benchmark]: RCFGBuilder took 516.74 ms. Allocated memory was 299.9 MB in the beginning and 456.1 MB in the end (delta: 156.2 MB). Free memory was 229.4 MB in the beginning and 405.5 MB in the end (delta: -176.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:47,540 INFO L168 Benchmark]: TraceAbstraction took 168355.91 ms. Allocated memory was 456.1 MB in the beginning and 536.9 MB in the end (delta: 80.7 MB). Free memory was 405.5 MB in the beginning and 362.3 MB in the end (delta: 43.2 MB). Peak memory consumption was 164.3 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:47,542 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 299.9 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 243.97 ms. Allocated memory is still 299.9 MB. Free memory was 241.4 MB in the beginning and 231.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.98 ms. Allocated memory is still 299.9 MB. Free memory was 231.4 MB in the beginning and 229.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 516.74 ms. Allocated memory was 299.9 MB in the beginning and 456.1 MB in the end (delta: 156.2 MB). Free memory was 229.4 MB in the beginning and 405.5 MB in the end (delta: -176.1 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 168355.91 ms. Allocated memory was 456.1 MB in the beginning and 536.9 MB in the end (delta: 80.7 MB). Free memory was 405.5 MB in the beginning and 362.3 MB in the end (delta: 43.2 MB). Peak memory consumption was 164.3 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - 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 forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3677. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 168.3s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 750 SDslu, 1125 SDs, 0 SdLazy, 376 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s 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-03-29_21-40-47-553.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-03-29_21-40-47-553.csv Completed graceful shutdown