java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cf7e2d-m [2018-03-29 21:38:00,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 21:38:00,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 21:38:00,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 21:38:00,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 21:38:00,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 21:38:00,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 21:38:00,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 21:38:00,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 21:38:00,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 21:38:00,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 21:38:00,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 21:38:00,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 21:38:00,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 21:38:00,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 21:38:00,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 21:38:00,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 21:38:00,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 21:38:00,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 21:38:00,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 21:38:00,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 21:38:00,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 21:38:00,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 21:38:00,936 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 21:38:00,936 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 21:38:00,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 21:38:00,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 21:38:00,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 21:38:00,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 21:38:00,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 21:38:00,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 21:38:00,941 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:38:00,968 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 21:38:00,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 21:38:00,969 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 21:38:00,969 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 21:38:00,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 21:38:00,970 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 21:38:00,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 21:38:00,971 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 21:38:00,971 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 21:38:00,971 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 21:38:00,971 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 21:38:00,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 21:38:00,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 21:38:00,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 21:38:00,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 21:38:00,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 21:38:00,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 21:38:00,973 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 21:38:00,973 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 21:38:00,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 21:38:00,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 21:38:00,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 21:38:00,974 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 21:38:00,974 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 21:38:00,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 21:38:00,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:38:00,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 21:38:00,975 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 21:38:00,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 21:38:00,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 21:38:00,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 21:38:00,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:38:00,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 21:38:00,977 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 21:38:00,977 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 21:38:00,977 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 21:38:00,977 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 21:38:01,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 21:38:01,027 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 21:38:01,031 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 21:38:01,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 21:38:01,034 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 21:38:01,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i [2018-03-29 21:38:01,378 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG75b7b32d2 [2018-03-29 21:38:01,491 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 21:38:01,492 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 21:38:01,492 INFO L168 CDTParser]: Scanning test-bitfields-2.1_false-valid-free.i [2018-03-29 21:38:01,493 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 21:38:01,493 INFO L215 ultiparseSymbolTable]: [2018-03-29 21:38:01,494 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 21:38:01,494 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2.1_false-valid-free.i [2018-03-29 21:38:01,494 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 21:38:01,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__d in test-bitfields-2.1_false-valid-free.i [2018-03-29 21:38:01,494 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__size_t in test-bitfields-2.1_false-valid-free.i [2018-03-29 21:38:01,510 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG75b7b32d2 [2018-03-29 21:38:01,515 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 21:38:01,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 21:38:01,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 21:38:01,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 21:38:01,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 21:38:01,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23427cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01, skipping insertion in model container [2018-03-29 21:38:01,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,546 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:38:01,559 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:38:01,704 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:38:01,732 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:38:01,738 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-29 21:38:01,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01 WrapperNode [2018-03-29 21:38:01,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 21:38:01,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 21:38:01,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 21:38:01,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 21:38:01,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (1/1) ... [2018-03-29 21:38:01,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 21:38:01,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 21:38:01,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 21:38:01,787 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 21:38:01,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (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:38:01,847 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 21:38:01,847 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 21:38:01,848 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 21:38:01,848 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-29 21:38:01,848 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-29 21:38:01,848 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 21:38:01,848 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 21:38:01,848 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 21:38:01,849 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 21:38:01,849 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-29 21:38:01,849 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 21:38:01,849 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 21:38:01,849 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 21:38:01,849 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 21:38:01,849 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 21:38:01,850 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 21:38:02,240 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-29 21:38:02,289 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 21:38:02,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:38:02 BoogieIcfgContainer [2018-03-29 21:38:02,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 21:38:02,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 21:38:02,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 21:38:02,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 21:38:02,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 09:38:01" (1/3) ... [2018-03-29 21:38:02,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e8c0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:38:02, skipping insertion in model container [2018-03-29 21:38:02,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:38:01" (2/3) ... [2018-03-29 21:38:02,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e8c0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:38:02, skipping insertion in model container [2018-03-29 21:38:02,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:38:02" (3/3) ... [2018-03-29 21:38:02,297 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i [2018-03-29 21:38:02,305 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 21:38:02,312 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-03-29 21:38:02,351 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 21:38:02,352 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 21:38:02,352 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 21:38:02,352 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 21:38:02,352 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 21:38:02,352 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 21:38:02,353 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 21:38:02,353 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 21:38:02,353 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 21:38:02,354 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 21:38:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-03-29 21:38:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:38:02,376 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:02,377 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:02,377 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash -329008504, 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:38:02,392 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:02,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:02,493 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:02,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:38:02,537 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:02,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,542 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:02,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-29 21:38:02,552 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:02,552 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:02,603 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:02,628 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:02,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 21:38:02,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 21:38:02,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 21:38:02,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 21:38:02,645 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-03-29 21:38:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:02,768 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-03-29 21:38:02,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:38:02,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-03-29 21:38:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:02,784 INFO L225 Difference]: With dead ends: 143 [2018-03-29 21:38:02,785 INFO L226 Difference]: Without dead ends: 134 [2018-03-29 21:38:02,788 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:02,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-03-29 21:38:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-03-29 21:38:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-29 21:38:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-03-29 21:38:02,827 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 21 [2018-03-29 21:38:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:02,827 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-03-29 21:38:02,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 21:38:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-03-29 21:38:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:38:02,829 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:02,829 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:02,829 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash -329008503, 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:38:02,835 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:02,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:02,875 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:02,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,900 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:02,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 21:38:02,940 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,941 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,943 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 12 treesize of output 21 [2018-03-29 21:38:02,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,963 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,968 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:02,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 21:38:02,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:02,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:38:02,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-03-29 21:38:03,027 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:03,027 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:03,193 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:03,228 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:03,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:38:03,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:38:03,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:38:03,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:38:03,231 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2018-03-29 21:38:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:03,424 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-03-29 21:38:03,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:38:03,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-29 21:38:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:03,427 INFO L225 Difference]: With dead ends: 134 [2018-03-29 21:38:03,427 INFO L226 Difference]: Without dead ends: 128 [2018-03-29 21:38:03,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-03-29 21:38:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-03-29 21:38:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2018-03-29 21:38:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-03-29 21:38:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-03-29 21:38:03,440 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 21 [2018-03-29 21:38:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:03,440 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-03-29 21:38:03,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:38:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-03-29 21:38:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-03-29 21:38:03,442 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:03,442 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] [2018-03-29 21:38:03,442 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1500569353, 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:03,451 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:03,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:03,482 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:03,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:03,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:03,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:38:03,499 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:03,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:03,509 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:03,531 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:03,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:38:03,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:38:03,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:38:03,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:38:03,532 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 4 states. [2018-03-29 21:38:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:03,610 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-03-29 21:38:03,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:38:03,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-03-29 21:38:03,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:03,612 INFO L225 Difference]: With dead ends: 133 [2018-03-29 21:38:03,612 INFO L226 Difference]: Without dead ends: 123 [2018-03-29 21:38:03,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:38:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-03-29 21:38:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-03-29 21:38:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-29 21:38:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-03-29 21:38:03,623 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 26 [2018-03-29 21:38:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:03,623 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-03-29 21:38:03,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:38:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-03-29 21:38:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-03-29 21:38:03,624 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:03,624 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] [2018-03-29 21:38:03,624 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1500569351, 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:03,631 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:03,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:03,651 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:03,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:03,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:03,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:38:03,674 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:03,674 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:03,695 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:03,716 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:03,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:38:03,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:38:03,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:38:03,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:38:03,717 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 6 states. [2018-03-29 21:38:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:03,807 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-03-29 21:38:03,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 21:38:03,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-03-29 21:38:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:03,809 INFO L225 Difference]: With dead ends: 89 [2018-03-29 21:38:03,809 INFO L226 Difference]: Without dead ends: 79 [2018-03-29 21:38:03,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-03-29 21:38:03,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-03-29 21:38:03,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-03-29 21:38:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-03-29 21:38:03,816 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 26 [2018-03-29 21:38:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:03,816 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-03-29 21:38:03,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:38:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-03-29 21:38:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-29 21:38:03,818 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:03,818 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:03,818 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:03,818 INFO L82 PathProgramCache]: Analyzing trace with hash 826268719, 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:03,824 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:03,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:03,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:03,860 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:03,899 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:03,924 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:38:03,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-29 21:38:03,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:38:03,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:38:03,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:38:03,926 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-03-29 21:38:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:03,967 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-03-29 21:38:03,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 21:38:03,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-03-29 21:38:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:03,968 INFO L225 Difference]: With dead ends: 130 [2018-03-29 21:38:03,969 INFO L226 Difference]: Without dead ends: 83 [2018-03-29 21:38:03,969 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 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:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-03-29 21:38:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-03-29 21:38:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-03-29 21:38:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-03-29 21:38:03,977 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 42 [2018-03-29 21:38:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:03,978 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-03-29 21:38:03,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:38:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-03-29 21:38:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-03-29 21:38:03,979 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:03,980 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:03,980 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1613333361, 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:03,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:04,015 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:04,075 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:04,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:04,122 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:04,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:38:04,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-29 21:38:04,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 21:38:04,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 21:38:04,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-03-29 21:38:04,143 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 10 states. [2018-03-29 21:38:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:04,194 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-03-29 21:38:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-29 21:38:04,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-03-29 21:38:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:04,195 INFO L225 Difference]: With dead ends: 136 [2018-03-29 21:38:04,195 INFO L226 Difference]: Without dead ends: 89 [2018-03-29 21:38:04,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-03-29 21:38:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-03-29 21:38:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-03-29 21:38:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-29 21:38:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-03-29 21:38:04,204 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 48 [2018-03-29 21:38:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:04,205 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-03-29 21:38:04,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 21:38:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-03-29 21:38:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 21:38:04,207 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:04,207 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:04,207 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash 21714159, 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:04,217 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:04,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:04,280 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:04,289 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:04,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-03-29 21:38:04,307 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:04,309 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,310 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,311 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:04,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-03-29 21:38:04,336 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:04,341 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,342 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,343 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,344 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,345 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,347 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-03-29 21:38:04,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-03-29 21:38:04,397 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:04,400 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,414 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,415 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,415 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,421 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,422 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,423 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,424 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,425 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,425 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,426 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,427 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-03-29 21:38:04,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-03-29 21:38:04,507 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:04,511 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,513 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,514 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,515 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,515 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,516 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,517 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,518 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,518 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,519 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,520 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,520 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,521 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,522 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,523 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,524 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,524 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,525 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,526 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,526 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-03-29 21:38:04,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-03-29 21:38:04,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-03-29 21:38:04,590 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,591 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,591 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,592 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,593 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,593 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,594 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,594 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,595 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,596 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,596 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,597 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,597 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,598 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,599 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,599 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,600 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,601 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,601 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,602 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:04,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-03-29 21:38:04,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:04,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-03-29 21:38:05,247 WARN L151 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 98 DAG size of output 37 [2018-03-29 21:38:05,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 74 [2018-03-29 21:38:05,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2018-03-29 21:38:05,280 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,281 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2018-03-29 21:38:05,286 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,287 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,287 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,288 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 98 [2018-03-29 21:38:05,301 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,301 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,302 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 131 [2018-03-29 21:38:05,308 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:38:05,386 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:204, output treesize:92 [2018-03-29 21:38:05,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2018-03-29 21:38:05,439 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,451 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,452 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,453 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2018-03-29 21:38:05,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,480 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,482 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,482 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,483 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,483 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,484 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-03-29 21:38:05,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,536 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,549 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,551 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,559 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:38:05,560 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,561 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,562 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,562 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,563 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,564 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,565 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:05,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-03-29 21:38:05,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:05,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:3 [2018-03-29 21:38:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:05,612 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:38:06,552 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 21:38:06,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:06,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:06,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:269, output treesize:1 [2018-03-29 21:38:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:06,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:38:06,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-03-29 21:38:06,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-03-29 21:38:06,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-03-29 21:38:06,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2018-03-29 21:38:06,598 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 36 states. [2018-03-29 21:38:07,983 WARN L151 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-03-29 21:38:08,294 WARN L151 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 97 DAG size of output 92 [2018-03-29 21:38:08,596 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-03-29 21:38:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:38:09,921 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-03-29 21:38:09,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-03-29 21:38:09,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-03-29 21:38:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:38:09,925 INFO L225 Difference]: With dead ends: 225 [2018-03-29 21:38:09,925 INFO L226 Difference]: Without dead ends: 187 [2018-03-29 21:38:09,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=550, Invalid=3232, Unknown=0, NotChecked=0, Total=3782 [2018-03-29 21:38:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-03-29 21:38:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2018-03-29 21:38:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-03-29 21:38:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-03-29 21:38:09,940 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 54 [2018-03-29 21:38:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:38:09,940 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-03-29 21:38:09,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-03-29 21:38:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-03-29 21:38:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-29 21:38:09,942 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:38:09,943 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:38:09,943 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-03-29 21:38:09,943 INFO L82 PathProgramCache]: Analyzing trace with hash 959712699, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:38:09,952 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:38:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:38:09,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:38:10,014 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:10,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:38:10,030 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,031 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 21:38:10,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-29 21:38:10,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-29 21:38:10,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-29 21:38:10,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-03-29 21:38:10,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-29 21:38:10,077 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,078 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-03-29 21:38:10,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-03-29 21:38:10,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-03-29 21:38:10,108 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,109 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,109 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,110 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,111 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,112 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-03-29 21:38:10,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-03-29 21:38:10,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-03-29 21:38:10,176 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,177 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,177 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,178 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,179 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,179 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,180 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,181 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,183 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,184 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-03-29 21:38:10,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-03-29 21:38:10,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-03-29 21:38:10,261 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,262 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,262 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,263 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,263 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,264 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,264 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,265 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,266 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,266 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,267 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,267 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:10,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-03-29 21:38:10,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:10,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-03-29 21:38:12,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-03-29 21:38:12,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-03-29 21:38:12,741 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-03-29 21:38:12,747 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,748 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,750 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-03-29 21:38:12,761 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,763 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,764 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,766 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,768 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,770 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 99 [2018-03-29 21:38:12,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-03-29 21:38:12,866 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:232, output treesize:112 [2018-03-29 21:38:12,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-03-29 21:38:12,942 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,943 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,943 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,944 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,945 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,946 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,947 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,947 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:38:12,948 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 71 [2018-03-29 21:38:12,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,977 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,977 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,978 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:38:12,978 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,979 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,979 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,980 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,980 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:38:12,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-03-29 21:38:12,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:38:12,998 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:121, output treesize:3 [2018-03-29 21:38:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:38:13,041 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:39:55,350 WARN L148 SmtUtils]: Spent 2067ms on a formula simplification that was a NOOP. DAG size: 82 [2018-03-29 21:40:30,837 WARN L148 SmtUtils]: Spent 2062ms on a formula simplification that was a NOOP. DAG size: 88 Received shutdown request... [2018-03-29 21:40:48,424 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-29 21:40:48,425 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 21:40:48,430 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 21:40:48,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 09:40:48 BoogieIcfgContainer [2018-03-29 21:40:48,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 21:40:48,431 INFO L168 Benchmark]: Toolchain (without parser) took 166916.06 ms. Allocated memory was 303.6 MB in the beginning and 588.8 MB in the end (delta: 285.2 MB). Free memory was 247.2 MB in the beginning and 428.2 MB in the end (delta: -181.0 MB). Peak memory consumption was 104.2 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:48,432 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.6 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 21:40:48,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.37 ms. Allocated memory is still 303.6 MB. Free memory was 245.2 MB in the beginning and 235.2 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:48,433 INFO L168 Benchmark]: Boogie Preprocessor took 36.69 ms. Allocated memory is still 303.6 MB. Free memory was 235.2 MB in the beginning and 233.2 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:48,433 INFO L168 Benchmark]: RCFGBuilder took 503.62 ms. Allocated memory was 303.6 MB in the beginning and 463.5 MB in the end (delta: 159.9 MB). Free memory was 233.2 MB in the beginning and 421.2 MB in the end (delta: -188.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:48,434 INFO L168 Benchmark]: TraceAbstraction took 166139.20 ms. Allocated memory was 463.5 MB in the beginning and 588.8 MB in the end (delta: 125.3 MB). Free memory was 421.2 MB in the beginning and 428.2 MB in the end (delta: -7.0 MB). Peak memory consumption was 118.3 MB. Max. memory is 5.3 GB. [2018-03-29 21:40:48,436 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 303.6 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.37 ms. Allocated memory is still 303.6 MB. Free memory was 245.2 MB in the beginning and 235.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.69 ms. Allocated memory is still 303.6 MB. Free memory was 235.2 MB in the beginning and 233.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 503.62 ms. Allocated memory was 303.6 MB in the beginning and 463.5 MB in the end (delta: 159.9 MB). Free memory was 233.2 MB in the beginning and 421.2 MB in the end (delta: -188.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 166139.20 ms. Allocated memory was 463.5 MB in the beginning and 588.8 MB in the end (delta: 125.3 MB). Free memory was 421.2 MB in the beginning and 428.2 MB in the end (delta: -7.0 MB). Peak memory consumption was 118.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 40). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 40). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 33 error locations. TIMEOUT Result, 166.0s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 425 SDtfs, 1325 SDslu, 1381 SDs, 0 SdLazy, 1225 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 404 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 191 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 462 ConstructedInterpolants, 44 QuantifiedInterpolants, 483728 SizeOfPredicates, 23 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-29_21-40-48-445.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-29_21-40-48-445.csv Completed graceful shutdown