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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 21:28:59,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 21:28:59,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 21:29:00,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 21:29:00,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 21:29:00,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 21:29:00,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 21:29:00,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 21:29:00,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 21:29:00,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 21:29:00,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 21:29:00,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 21:29:00,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 21:29:00,017 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 21:29:00,018 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 21:29:00,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 21:29:00,022 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 21:29:00,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 21:29:00,026 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 21:29:00,027 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 21:29:00,029 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 21:29:00,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 21:29:00,030 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 21:29:00,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 21:29:00,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 21:29:00,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 21:29:00,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 21:29:00,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 21:29:00,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 21:29:00,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 21:29:00,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 21:29:00,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 21:29:00,061 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 21:29:00,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 21:29:00,061 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 21:29:00,062 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 21:29:00,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 21:29:00,062 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 21:29:00,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 21:29:00,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 21:29:00,063 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 21:29:00,063 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 21:29:00,064 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 21:29:00,064 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 21:29:00,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 21:29:00,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 21:29:00,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 21:29:00,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 21:29:00,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 21:29:00,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 21:29:00,065 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 21:29:00,066 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 21:29:00,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 21:29:00,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 21:29:00,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 21:29:00,066 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 21:29:00,067 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 21:29:00,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 21:29:00,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:29:00,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 21:29:00,067 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 21:29:00,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 21:29:00,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 21:29:00,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 21:29:00,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:00,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 21:29:00,069 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 21:29:00,070 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 21:29:00,070 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 21:29:00,070 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 21:29:00,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 21:29:00,119 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 21:29:00,123 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 21:29:00,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 21:29:00,125 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 21:29:00,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-06 21:29:00,475 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ddbde577 [2018-04-06 21:29:00,591 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 21:29:00,592 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 21:29:00,592 INFO L168 CDTParser]: Scanning test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-06 21:29:00,593 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 21:29:00,594 INFO L215 ultiparseSymbolTable]: [2018-04-06 21:29:00,594 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 21:29:00,594 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-06 21:29:00,594 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 21:29:00,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-06 21:29:00,594 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-06 21:29:00,610 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1ddbde577 [2018-04-06 21:29:00,614 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 21:29:00,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 21:29:00,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 21:29:00,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 21:29:00,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 21:29:00,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbdac03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00, skipping insertion in model container [2018-04-06 21:29:00,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,640 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:29:00,652 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:29:00,779 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:29:00,805 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:29:00,811 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-06 21:29:00,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00 WrapperNode [2018-04-06 21:29:00,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 21:29:00,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 21:29:00,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 21:29:00,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 21:29:00,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... [2018-04-06 21:29:00,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 21:29:00,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 21:29:00,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 21:29:00,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 21:29:00,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:29:00,932 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 21:29:00,932 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 21:29:00,932 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 21:29:00,932 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 21:29:00,933 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 21:29:00,934 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 21:29:00,934 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 21:29:00,934 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 21:29:01,339 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-06 21:29:01,374 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 21:29:01,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:29:01 BoogieIcfgContainer [2018-04-06 21:29:01,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 21:29:01,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 21:29:01,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 21:29:01,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 21:29:01,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:29:00" (1/3) ... [2018-04-06 21:29:01,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ffb9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:29:01, skipping insertion in model container [2018-04-06 21:29:01,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:29:00" (2/3) ... [2018-04-06 21:29:01,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ffb9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:29:01, skipping insertion in model container [2018-04-06 21:29:01,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:29:01" (3/3) ... [2018-04-06 21:29:01,382 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-06 21:29:01,391 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 21:29:01,397 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-06 21:29:01,441 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 21:29:01,442 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 21:29:01,442 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 21:29:01,442 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 21:29:01,442 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 21:29:01,442 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 21:29:01,442 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 21:29:01,442 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 21:29:01,442 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 21:29:01,443 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 21:29:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-04-06 21:29:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-06 21:29:01,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:29:01,462 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:29:01,462 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-06 21:29:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash -506314848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:01,482 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:29:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:29:01,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:29:01,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:29:01,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:01,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:01,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:29:01,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 21:29:01,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:01,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:29:01,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-06 21:29:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:01,620 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:29:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:01,692 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:29:01,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 21:29:01,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 21:29:01,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 21:29:01,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 21:29:01,712 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-04-06 21:29:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:29:01,859 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-04-06 21:29:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 21:29:01,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-06 21:29:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:29:01,878 INFO L225 Difference]: With dead ends: 160 [2018-04-06 21:29:01,878 INFO L226 Difference]: Without dead ends: 151 [2018-04-06 21:29:01,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 21:29:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-06 21:29:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-04-06 21:29:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-06 21:29:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-04-06 21:29:01,932 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-04-06 21:29:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:29:01,933 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-04-06 21:29:01,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 21:29:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-04-06 21:29:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-06 21:29:01,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:29:01,934 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:29:01,934 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-06 21:29:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash -506314847, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:01,944 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:29:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:29:01,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:29:01,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:29:01,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:01,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:29:01,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:01,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:01,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 21:29:02,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:02,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:02,019 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-04-06 21:29:02,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:02,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:02,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:02,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 21:29:02,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:02,062 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-04-06 21:29:02,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-06 21:29:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:02,083 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:29:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:02,249 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:29:02,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 21:29:02,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 21:29:02,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 21:29:02,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:29:02,252 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 6 states. [2018-04-06 21:29:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:29:02,441 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-04-06 21:29:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:29:02,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-06 21:29:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:29:02,443 INFO L225 Difference]: With dead ends: 151 [2018-04-06 21:29:02,443 INFO L226 Difference]: Without dead ends: 145 [2018-04-06 21:29:02,444 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:29:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-06 21:29:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-04-06 21:29:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-06 21:29:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-06 21:29:02,456 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-04-06 21:29:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:29:02,457 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-06 21:29:02,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 21:29:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-06 21:29:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-06 21:29:02,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:29:02,458 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:29:02,458 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-06 21:29:02,459 INFO L82 PathProgramCache]: Analyzing trace with hash 51854364, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:02,469 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:29:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:29:02,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:29:02,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:29:02,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:02,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:02,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:29:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:02,540 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:29:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:02,627 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:29:02,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 21:29:02,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 21:29:02,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 21:29:02,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:29:02,629 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-04-06 21:29:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:29:02,842 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-04-06 21:29:02,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 21:29:02,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-06 21:29:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:29:02,843 INFO L225 Difference]: With dead ends: 96 [2018-04-06 21:29:02,844 INFO L226 Difference]: Without dead ends: 72 [2018-04-06 21:29:02,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:29:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-06 21:29:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-06 21:29:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-06 21:29:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-06 21:29:02,853 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2018-04-06 21:29:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:29:02,853 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-06 21:29:02,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 21:29:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-06 21:29:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-06 21:29:02,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:29:02,854 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:29:02,855 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-06 21:29:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash 51854362, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:02,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:29:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:29:02,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:29:02,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:29:02,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:02,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:02,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:29:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:02,892 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:29:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:02,920 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:29:02,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 21:29:02,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 21:29:02,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 21:29:02,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:29:02,921 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2018-04-06 21:29:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:29:03,008 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-04-06 21:29:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:29:03,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-06 21:29:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:29:03,010 INFO L225 Difference]: With dead ends: 103 [2018-04-06 21:29:03,011 INFO L226 Difference]: Without dead ends: 93 [2018-04-06 21:29:03,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:29:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-06 21:29:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2018-04-06 21:29:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-06 21:29:03,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-04-06 21:29:03,019 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 21 [2018-04-06 21:29:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:29:03,019 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-04-06 21:29:03,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 21:29:03,020 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-04-06 21:29:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-06 21:29:03,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:29:03,021 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:29:03,021 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-06 21:29:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2075956322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:03,034 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:29:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:29:03,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:29:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:03,114 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:29:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:03,179 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:29:03,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 21:29:03,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 21:29:03,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 21:29:03,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:29:03,181 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-04-06 21:29:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:29:03,209 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-04-06 21:29:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 21:29:03,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-04-06 21:29:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:29:03,211 INFO L225 Difference]: With dead ends: 117 [2018-04-06 21:29:03,211 INFO L226 Difference]: Without dead ends: 74 [2018-04-06 21:29:03,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:29:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-06 21:29:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-06 21:29:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-06 21:29:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-04-06 21:29:03,219 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 37 [2018-04-06 21:29:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:29:03,220 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-04-06 21:29:03,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 21:29:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-04-06 21:29:03,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-06 21:29:03,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:29:03,221 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:29:03,221 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-06 21:29:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1900445346, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:03,231 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:29:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:29:03,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:29:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:03,290 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:29:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:03,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:29:03,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-06 21:29:03,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 21:29:03,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 21:29:03,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-04-06 21:29:03,373 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-04-06 21:29:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:29:03,418 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-06 21:29:03,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 21:29:03,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-06 21:29:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:29:03,419 INFO L225 Difference]: With dead ends: 123 [2018-04-06 21:29:03,419 INFO L226 Difference]: Without dead ends: 80 [2018-04-06 21:29:03,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 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-04-06 21:29:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-06 21:29:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-06 21:29:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-06 21:29:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-04-06 21:29:03,428 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 43 [2018-04-06 21:29:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:29:03,428 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-04-06 21:29:03,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 21:29:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-04-06 21:29:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-06 21:29:03,430 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:29:03,430 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] [2018-04-06 21:29:03,430 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-04-06 21:29:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash 130529506, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:29:03,436 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:29:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:29:03,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:29:03,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 21:29:03,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:29:03,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-06 21:29:03,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 21:29:03,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-06 21:29:03,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-06 21:29:03,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-06 21:29:03,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-04-06 21:29:03,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-06 21:29:03,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-06 21:29:03,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-04-06 21:29:03,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-06 21:29:03,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-06 21:29:03,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-04-06 21:29:03,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-06 21:29:03,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-04-06 21:29:03,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:03,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-04-06 21:29:03,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:03,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-06 21:29:04,400 WARN L151 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 103 DAG size of output 42 [2018-04-06 21:29:04,431 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-04-06 21:29:04,435 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-04-06 21:29:04,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,441 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-04-06 21:29:04,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 76 [2018-04-06 21:29:04,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 105 [2018-04-06 21:29:04,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:04,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:04,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:04,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:04,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:04,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-06 21:29:04,601 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:212, output treesize:100 [2018-04-06 21:29:04,647 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-04-06 21:29:04,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:29:04,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:29:04,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,690 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:29:04,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,691 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:29:04,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:29:04,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 180 [2018-04-06 21:29:04,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 12 xjuncts. [2018-04-06 21:29:04,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:04,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:04,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:107, output treesize:7 [2018-04-06 21:29:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:04,920 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:29:09,559 WARN L148 SmtUtils]: Spent 309ms on a formula simplification that was a NOOP. DAG size: 77 [2018-04-06 21:29:17,652 WARN L148 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-06 21:29:22,465 WARN L148 SmtUtils]: Spent 451ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-06 21:29:29,014 WARN L148 SmtUtils]: Spent 2047ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-06 21:29:43,796 WARN L148 SmtUtils]: Spent 180ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-06 21:29:44,183 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 21:29:44,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:29:44,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:29:44,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:277, output treesize:1 [2018-04-06 21:29:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:29:44,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:29:44,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-04-06 21:29:44,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-06 21:29:44,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-06 21:29:44,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1039, Unknown=23, NotChecked=0, Total=1260 [2018-04-06 21:29:44,233 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 36 states. [2018-04-06 21:30:13,681 WARN L151 SmtUtils]: Spent 25550ms on a formula simplification. DAG size of input: 169 DAG size of output 148 [2018-04-06 21:30:27,119 WARN L151 SmtUtils]: Spent 5871ms on a formula simplification. DAG size of input: 133 DAG size of output 124 [2018-04-06 21:30:35,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-06 21:30:35,663 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:188) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1072) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:946) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:398) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1054) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:956) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:185) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:594) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:452) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 44 more [2018-04-06 21:30:35,666 INFO L168 Benchmark]: Toolchain (without parser) took 95051.22 ms. Allocated memory was 303.6 MB in the beginning and 550.5 MB in the end (delta: 246.9 MB). Free memory was 245.2 MB in the beginning and 444.8 MB in the end (delta: -199.6 MB). Peak memory consumption was 47.3 MB. Max. memory is 5.3 GB. [2018-04-06 21:30:35,667 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 303.6 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 21:30:35,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.54 ms. Allocated memory is still 303.6 MB. Free memory was 245.2 MB in the beginning and 234.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:30:35,668 INFO L168 Benchmark]: Boogie Preprocessor took 41.95 ms. Allocated memory is still 303.6 MB. Free memory was 234.1 MB in the beginning and 233.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-04-06 21:30:35,668 INFO L168 Benchmark]: RCFGBuilder took 504.86 ms. Allocated memory was 303.6 MB in the beginning and 463.5 MB in the end (delta: 159.9 MB). Free memory was 232.1 MB in the beginning and 419.2 MB in the end (delta: -187.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-04-06 21:30:35,669 INFO L168 Benchmark]: TraceAbstraction took 94290.10 ms. Allocated memory was 463.5 MB in the beginning and 550.5 MB in the end (delta: 87.0 MB). Free memory was 419.2 MB in the beginning and 444.8 MB in the end (delta: -25.6 MB). Peak memory consumption was 61.5 MB. Max. memory is 5.3 GB. [2018-04-06 21:30:35,671 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.28 ms. Allocated memory is still 303.6 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.54 ms. Allocated memory is still 303.6 MB. Free memory was 245.2 MB in the beginning and 234.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.95 ms. Allocated memory is still 303.6 MB. Free memory was 234.1 MB in the beginning and 233.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 504.86 ms. Allocated memory was 303.6 MB in the beginning and 463.5 MB in the end (delta: 159.9 MB). Free memory was 232.1 MB in the beginning and 419.2 MB in the end (delta: -187.1 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 94290.10 ms. Allocated memory was 463.5 MB in the beginning and 550.5 MB in the end (delta: 87.0 MB). Free memory was 419.2 MB in the beginning and 444.8 MB in the end (delta: -25.6 MB). Peak memory consumption was 61.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_21-30-35-678.csv Received shutdown request...