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_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4cf2d92 [2018-03-28 13:21:58,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-28 13:21:58,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-28 13:21:58,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-28 13:21:58,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-28 13:21:58,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-28 13:21:58,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-28 13:21:58,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-28 13:21:58,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-28 13:21:58,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-28 13:21:58,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-28 13:21:58,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-28 13:21:58,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-28 13:21:58,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-28 13:21:58,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-28 13:21:58,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-28 13:21:58,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-28 13:21:58,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-28 13:21:58,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-28 13:21:58,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-28 13:21:58,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-28 13:21:58,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-28 13:21:58,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-28 13:21:58,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-28 13:21:58,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-28 13:21:58,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-28 13:21:58,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-28 13:21:58,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-28 13:21:58,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-28 13:21:58,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-28 13:21:58,048 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-28 13:21:58,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-28 13:21:58,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-28 13:21:58,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-28 13:21:58,072 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-28 13:21:58,072 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-28 13:21:58,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-28 13:21:58,073 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-28 13:21:58,073 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-28 13:21:58,073 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-28 13:21:58,073 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-28 13:21:58,073 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-28 13:21:58,073 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-28 13:21:58,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-28 13:21:58,074 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-28 13:21:58,074 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-28 13:21:58,074 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-28 13:21:58,074 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-28 13:21:58,074 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-28 13:21:58,075 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-28 13:21:58,075 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-28 13:21:58,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-28 13:21:58,075 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-28 13:21:58,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-28 13:21:58,075 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-28 13:21:58,076 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-28 13:21:58,076 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-28 13:21:58,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 13:21:58,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-28 13:21:58,076 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-28 13:21:58,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-28 13:21:58,077 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-28 13:21:58,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-28 13:21:58,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:21:58,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-28 13:21:58,078 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-28 13:21:58,078 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-28 13:21:58,078 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-28 13:21:58,078 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-28 13:21:58,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-28 13:21:58,119 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-28 13:21:58,122 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-28 13:21:58,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-28 13:21:58,124 INFO L276 PluginConnector]: CDTParser initialized [2018-03-28 13:21:58,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-03-28 13:21:58,436 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6be6fa125 [2018-03-28 13:21:58,549 INFO L291 CDTParser]: IsIndexed: true [2018-03-28 13:21:58,550 INFO L292 CDTParser]: Found 1 translation units. [2018-03-28 13:21:58,550 INFO L171 CDTParser]: Scanning test-bitfields-2_false-valid-deref.i [2018-03-28 13:21:58,551 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-28 13:21:58,551 INFO L215 ultiparseSymbolTable]: [2018-03-28 13:21:58,551 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-28 13:21:58,551 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_false-valid-deref.i [2018-03-28 13:21:58,552 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-28 13:21:58,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-2_false-valid-deref.i [2018-03-28 13:21:58,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-2_false-valid-deref.i [2018-03-28 13:21:58,568 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6be6fa125 [2018-03-28 13:21:58,572 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-28 13:21:58,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-28 13:21:58,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-28 13:21:58,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-28 13:21:58,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-28 13:21:58,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55171e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58, skipping insertion in model container [2018-03-28 13:21:58,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,599 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 13:21:58,611 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 13:21:58,735 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 13:21:58,762 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 13:21:58,767 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-28 13:21:58,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58 WrapperNode [2018-03-28 13:21:58,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-28 13:21:58,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-28 13:21:58,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-28 13:21:58,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-28 13:21:58,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... [2018-03-28 13:21:58,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-28 13:21:58,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-28 13:21:58,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-28 13:21:58,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-28 13:21:58,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 13:21:58,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-28 13:21:58,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-28 13:21:58,876 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-28 13:21:58,876 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-28 13:21:58,876 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-28 13:21:58,876 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-28 13:21:58,876 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-28 13:21:58,876 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-28 13:21:58,877 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-28 13:21:58,877 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-28 13:21:58,877 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-28 13:21:58,877 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-28 13:21:58,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-28 13:21:58,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-28 13:21:58,878 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-28 13:21:58,878 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-28 13:21:59,257 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-28 13:21:59,332 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-28 13:21:59,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 01:21:59 BoogieIcfgContainer [2018-03-28 13:21:59,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-28 13:21:59,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-28 13:21:59,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-28 13:21:59,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-28 13:21:59,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 01:21:58" (1/3) ... [2018-03-28 13:21:59,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ae7230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 01:21:59, skipping insertion in model container [2018-03-28 13:21:59,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:58" (2/3) ... [2018-03-28 13:21:59,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ae7230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 01:21:59, skipping insertion in model container [2018-03-28 13:21:59,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 01:21:59" (3/3) ... [2018-03-28 13:21:59,340 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-03-28 13:21:59,346 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-28 13:21:59,352 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-03-28 13:21:59,395 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-28 13:21:59,395 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-28 13:21:59,396 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-28 13:21:59,396 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-28 13:21:59,396 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-28 13:21:59,396 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-28 13:21:59,396 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-28 13:21:59,396 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-28 13:21:59,397 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-28 13:21:59,397 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-28 13:21:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-03-28 13:21:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-28 13:21:59,416 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:59,416 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:59,417 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-03-28 13:21:59,420 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-03-28 13:21:59,431 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:59,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:59,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:21:59,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:59,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:59,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 13:21:59,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 13:21:59,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:59,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 13:21:59,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-28 13:21:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:59,582 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:59,644 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:21:59,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-28 13:21:59,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 13:21:59,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 13:21:59,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 13:21:59,664 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-03-28 13:21:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:59,805 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-03-28 13:21:59,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 13:21:59,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-03-28 13:21:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:59,821 INFO L225 Difference]: With dead ends: 160 [2018-03-28 13:21:59,822 INFO L226 Difference]: Without dead ends: 151 [2018-03-28 13:21:59,825 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-03-28 13:21:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-03-28 13:21:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-03-28 13:21:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-28 13:21:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-03-28 13:21:59,872 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-03-28 13:21:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:59,873 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-03-28 13:21:59,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 13:21:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-03-28 13:21:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-28 13:21:59,874 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:59,874 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:59,874 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-03-28 13:21:59,874 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-03-28 13:21:59,884 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:59,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:59,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:21:59,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:59,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:59,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 13:21:59,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 13:21:59,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:59,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 13:21:59,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-03-28 13:21:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:59,950 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:22:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:00,281 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:22:00,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-03-28 13:22:00,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 13:22:00,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 13:22:00,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-28 13:22:00,283 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 5 states. [2018-03-28 13:22:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:22:00,345 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-03-28 13:22:00,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 13:22:00,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-03-28 13:22:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:22:00,347 INFO L225 Difference]: With dead ends: 102 [2018-03-28 13:22:00,347 INFO L226 Difference]: Without dead ends: 96 [2018-03-28 13:22:00,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-28 13:22:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-28 13:22:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-03-28 13:22:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-28 13:22:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-03-28 13:22:00,359 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-03-28 13:22:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:22:00,360 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-03-28 13:22:00,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 13:22:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-03-28 13:22:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-28 13:22:00,361 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:22:00,361 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:22:00,361 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-03-28 13:22:00,361 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-03-28 13:22:00,371 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:22:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:22:00,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:22:00,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:22:00,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:00,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:00,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 13:22:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:00,423 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:22:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:00,509 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:22:00,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 13:22:00,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 13:22:00,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 13:22:00,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 13:22:00,510 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-03-28 13:22:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:22:00,618 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-03-28 13:22:00,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-28 13:22:00,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-28 13:22:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:22:00,620 INFO L225 Difference]: With dead ends: 96 [2018-03-28 13:22:00,620 INFO L226 Difference]: Without dead ends: 84 [2018-03-28 13:22:00,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-28 13:22:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-28 13:22:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-03-28 13:22:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-03-28 13:22:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-03-28 13:22:00,629 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2018-03-28 13:22:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:22:00,630 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-03-28 13:22:00,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 13:22:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-03-28 13:22:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-28 13:22:00,631 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:22:00,631 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:22:00,632 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-03-28 13:22:00,632 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-03-28 13:22:00,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:22:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:22:00,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:22:00,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:22:00,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:00,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:00,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 13:22:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:00,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:22:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:00,804 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:22:00,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 13:22:00,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 13:22:00,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 13:22:00,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 13:22:00,805 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 4 states. [2018-03-28 13:22:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:22:00,884 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-03-28 13:22:00,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 13:22:00,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-28 13:22:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:22:00,886 INFO L225 Difference]: With dead ends: 126 [2018-03-28 13:22:00,886 INFO L226 Difference]: Without dead ends: 114 [2018-03-28 13:22:00,886 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-03-28 13:22:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-03-28 13:22:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2018-03-28 13:22:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-03-28 13:22:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-03-28 13:22:00,893 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-03-28 13:22:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:22:00,894 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-03-28 13:22:00,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 13:22:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-03-28 13:22:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-28 13:22:00,895 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:22:00,895 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-03-28 13:22:00,895 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-03-28 13:22:00,896 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-03-28 13:22:00,902 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:22:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:22:00,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:22:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:00,944 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:22:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:00,992 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:22:00,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-28 13:22:00,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 13:22:00,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 13:22:00,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-28 13:22:00,993 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-03-28 13:22:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:22:01,018 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-03-28 13:22:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 13:22:01,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-03-28 13:22:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:22:01,020 INFO L225 Difference]: With dead ends: 143 [2018-03-28 13:22:01,020 INFO L226 Difference]: Without dead ends: 87 [2018-03-28 13:22:01,020 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-03-28 13:22:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-03-28 13:22:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-03-28 13:22:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-28 13:22:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-03-28 13:22:01,028 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 37 [2018-03-28 13:22:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:22:01,028 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-03-28 13:22:01,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 13:22:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-03-28 13:22:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-28 13:22:01,030 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:22:01,030 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-03-28 13:22:01,030 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-03-28 13:22:01,030 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-03-28 13:22:01,040 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:22:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:22:01,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:22:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:01,123 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:22:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:01,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 13:22:01,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-28 13:22:01,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-28 13:22:01,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-28 13:22:01,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-03-28 13:22:01,235 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-03-28 13:22:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:22:01,292 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-03-28 13:22:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-28 13:22:01,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-03-28 13:22:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:22:01,293 INFO L225 Difference]: With dead ends: 152 [2018-03-28 13:22:01,294 INFO L226 Difference]: Without dead ends: 96 [2018-03-28 13:22:01,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-03-28 13:22:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-28 13:22:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-03-28 13:22:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-28 13:22:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-03-28 13:22:01,303 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2018-03-28 13:22:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:22:01,303 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-03-28 13:22:01,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-28 13:22:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-03-28 13:22:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-28 13:22:01,304 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:22:01,304 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:22:01,305 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-03-28 13:22:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1778096232, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:22:01,314 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:22:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:22:01,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:22:01,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 13:22:01,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 13:22:01,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-03-28 13:22:01,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 13:22:01,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-03-28 13:22:01,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-03-28 13:22:01,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 13:22:01,416 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,417 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,418 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,418 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,419 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,420 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-03-28 13:22:01,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-03-28 13:22:01,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-03-28 13:22:01,456 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,457 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,457 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,458 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,458 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,459 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,460 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,461 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,462 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,463 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,463 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,464 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-03-28 13:22:01,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-03-28 13:22:01,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-03-28 13:22:01,529 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,530 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,531 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,531 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,532 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,532 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,533 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,534 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,534 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,535 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,536 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,536 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,537 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,538 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,538 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,539 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,540 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,540 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,541 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,542 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-03-28 13:22:01,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-03-28 13:22:01,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-03-28 13:22:01,625 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,625 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,626 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,626 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,627 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,627 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,628 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,628 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,629 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,629 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,630 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,631 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,631 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,632 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,632 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,634 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,634 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,635 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:01,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-03-28 13:22:01,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:01,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-03-28 13:22:03,060 WARN L151 SmtUtils]: Spent 870ms on a formula simplification. DAG size of input: 161 DAG size of output 40 [2018-03-28 13:22:03,098 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 87 treesize of output 81 [2018-03-28 13:22:03,112 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 88 treesize of output 90 [2018-03-28 13:22:03,128 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,129 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,131 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 51 treesize of output 69 [2018-03-28 13:22:03,136 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,137 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,139 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,140 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2018-03-28 13:22:03,147 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,148 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,149 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,150 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,151 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,152 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 165 [2018-03-28 13:22:03,171 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,173 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,174 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,175 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 214 [2018-03-28 13:22:03,184 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,238 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-28 13:22:03,427 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:375, output treesize:108 [2018-03-28 13:22:03,490 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 106 treesize of output 82 [2018-03-28 13:22:03,498 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,498 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:03,512 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,513 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,527 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,528 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,542 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,543 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,544 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,545 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:03,559 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,559 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:03,570 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,571 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:03,572 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,572 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:03,599 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,605 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,606 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,606 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:03,607 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-03-28 13:22:03,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 175 [2018-03-28 13:22:03,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-28 13:22:03,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:03,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:7 [2018-03-28 13:22:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:03,838 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:22:04,076 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 68 [2018-03-28 13:22:05,268 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 99 DAG size of output 85 [2018-03-28 13:22:05,896 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-03-28 13:22:06,610 WARN L148 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 98 [2018-03-28 13:22:07,483 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-03-28 13:22:07,976 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 13:22:07,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:07,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:07,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:552, output treesize:1 [2018-03-28 13:22:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:08,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 13:22:08,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 40 [2018-03-28 13:22:08,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-03-28 13:22:08,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-03-28 13:22:08,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1305, Unknown=10, NotChecked=0, Total=1560 [2018-03-28 13:22:08,039 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 40 states. [2018-03-28 13:22:12,820 WARN L151 SmtUtils]: Spent 2688ms on a formula simplification. DAG size of input: 200 DAG size of output 146 [2018-03-28 13:22:14,612 WARN L151 SmtUtils]: Spent 858ms on a formula simplification. DAG size of input: 144 DAG size of output 120 [2018-03-28 13:22:17,795 WARN L151 SmtUtils]: Spent 1953ms on a formula simplification. DAG size of input: 180 DAG size of output 151 [2018-03-28 13:22:19,663 WARN L151 SmtUtils]: Spent 1067ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-03-28 13:22:22,016 WARN L151 SmtUtils]: Spent 1296ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-03-28 13:22:23,074 WARN L148 SmtUtils]: Spent 339ms on a formula simplification that was a NOOP. DAG size: 122 [2018-03-28 13:22:24,801 WARN L151 SmtUtils]: Spent 410ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-03-28 13:22:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:22:26,772 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-03-28 13:22:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-28 13:22:26,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-03-28 13:22:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:22:26,777 INFO L225 Difference]: With dead ends: 313 [2018-03-28 13:22:26,777 INFO L226 Difference]: Without dead ends: 266 [2018-03-28 13:22:26,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=735, Invalid=4367, Unknown=10, NotChecked=0, Total=5112 [2018-03-28 13:22:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-03-28 13:22:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 116. [2018-03-28 13:22:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-03-28 13:22:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-03-28 13:22:26,799 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 52 [2018-03-28 13:22:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:22:26,800 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-03-28 13:22:26,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-03-28 13:22:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-03-28 13:22:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-28 13:22:26,801 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:22:26,802 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:22:26,802 INFO L408 AbstractCegarLoop]: === Iteration 8 === [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-03-28 13:22:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash -248522691, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:22:26,815 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:22:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:22:26,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:22:26,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:22:26,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 13:22:26,871 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,871 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-28 13:22:26,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-28 13:22:26,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-28 13:22:26,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-28 13:22:26,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-03-28 13:22:26,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-28 13:22:26,911 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,911 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-03-28 13:22:26,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-03-28 13:22:26,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-03-28 13:22:26,939 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,939 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,940 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,940 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,941 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,942 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-03-28 13:22:26,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:26,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-03-28 13:22:26,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-03-28 13:22:26,975 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,976 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,977 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,977 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,978 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,979 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,980 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,981 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,982 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,983 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,983 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,984 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:26,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-03-28 13:22:26,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-03-28 13:22:27,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-03-28 13:22:27,035 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,035 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,036 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,036 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,037 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,037 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,038 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,038 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,039 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,039 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,040 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,041 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-03-28 13:22:27,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-03-28 13:22:27,733 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 176 DAG size of output 57 [2018-03-28 13:22:27,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2018-03-28 13:22:27,759 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 56 treesize of output 59 [2018-03-28 13:22:27,763 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-03-28 13:22:27,772 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,774 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,775 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,781 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,782 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 61 treesize of output 97 [2018-03-28 13:22:27,786 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,787 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,788 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,789 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,790 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,797 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,799 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 149 [2018-03-28 13:22:27,808 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,809 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,810 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,811 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,812 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,813 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,813 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,817 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,822 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,824 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:27,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 240 [2018-03-28 13:22:27,825 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:27,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-28 13:22:27,941 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:419, output treesize:130 [2018-03-28 13:22:28,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2018-03-28 13:22:28,054 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,055 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,056 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,057 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:28,058 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,059 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,060 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,060 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,061 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,062 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:28,063 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,064 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,065 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,066 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,067 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,068 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,069 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,069 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:28,070 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,071 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:28,073 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,074 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,076 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,078 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,079 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,081 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 249 [2018-03-28 13:22:28,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:28,156 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,157 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,158 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,159 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,159 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,160 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,161 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,162 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,162 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:22:28,163 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,164 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,164 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,165 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,169 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,170 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:22:28,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 87 [2018-03-28 13:22:28,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-28 13:22:28,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:28,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:22:28,194 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:139, output treesize:3 [2018-03-28 13:22:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:22:28,254 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:23:32,434 WARN L148 SmtUtils]: Spent 192ms on a formula simplification that was a NOOP. DAG size: 85 [2018-03-28 13:24:15,022 WARN L148 SmtUtils]: Spent 387ms on a formula simplification that was a NOOP. DAG size: 91 Received shutdown request... [2018-03-28 13:24:42,571 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-28 13:24:42,572 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-28 13:24:42,576 WARN L197 ceAbstractionStarter]: Timeout [2018-03-28 13:24:42,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 01:24:42 BoogieIcfgContainer [2018-03-28 13:24:42,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-28 13:24:42,578 INFO L168 Benchmark]: Toolchain (without parser) took 164004.95 ms. Allocated memory was 307.8 MB in the beginning and 559.9 MB in the end (delta: 252.2 MB). Free memory was 251.6 MB in the beginning and 495.0 MB in the end (delta: -243.4 MB). Peak memory consumption was 8.7 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:42,579 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 307.8 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-28 13:24:42,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.12 ms. Allocated memory is still 307.8 MB. Free memory was 251.6 MB in the beginning and 240.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:42,580 INFO L168 Benchmark]: Boogie Preprocessor took 38.03 ms. Allocated memory is still 307.8 MB. Free memory was 240.4 MB in the beginning and 239.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-03-28 13:24:42,580 INFO L168 Benchmark]: RCFGBuilder took 512.82 ms. Allocated memory was 307.8 MB in the beginning and 469.8 MB in the end (delta: 162.0 MB). Free memory was 239.4 MB in the beginning and 427.6 MB in the end (delta: -188.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:42,581 INFO L168 Benchmark]: TraceAbstraction took 163242.77 ms. Allocated memory was 469.8 MB in the beginning and 559.9 MB in the end (delta: 90.2 MB). Free memory was 427.6 MB in the beginning and 495.0 MB in the end (delta: -67.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:42,583 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.20 ms. Allocated memory is still 307.8 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.12 ms. Allocated memory is still 307.8 MB. Free memory was 251.6 MB in the beginning and 240.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.03 ms. Allocated memory is still 307.8 MB. Free memory was 240.4 MB in the beginning and 239.4 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 512.82 ms. Allocated memory was 307.8 MB in the beginning and 469.8 MB in the end (delta: 162.0 MB). Free memory was 239.4 MB in the beginning and 427.6 MB in the end (delta: -188.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 163242.77 ms. Allocated memory was 469.8 MB in the beginning and 559.9 MB in the end (delta: 90.2 MB). Free memory was 427.6 MB in the beginning and 495.0 MB in the end (delta: -67.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 163.1s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 1931 SDslu, 1358 SDs, 0 SdLazy, 1286 SolverSat, 368 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 335 SyntacticMatches, 10 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 230 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 44 QuantifiedInterpolants, 986432 SizeOfPredicates, 21 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-28_13-24-42-593.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-28_13-24-42-593.csv Completed graceful shutdown