java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 21:30:37,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 21:30:37,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 21:30:37,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 21:30:37,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 21:30:37,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 21:30:37,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 21:30:37,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 21:30:37,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 21:30:37,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 21:30:37,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 21:30:37,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 21:30:37,412 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 21:30:37,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 21:30:37,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 21:30:37,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 21:30:37,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 21:30:37,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 21:30:37,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 21:30:37,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 21:30:37,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 21:30:37,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 21:30:37,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 21:30:37,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 21:30:37,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 21:30:37,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 21:30:37,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 21:30:37,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 21:30:37,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 21:30:37,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 21:30:37,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 21:30:37,431 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 21:30:37,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 21:30:37,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 21:30:37,456 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 21:30:37,456 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 21:30:37,457 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 21:30:37,457 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 21:30:37,457 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 21:30:37,457 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 21:30:37,458 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 21:30:37,458 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 21:30:37,458 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 21:30:37,458 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 21:30:37,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 21:30:37,459 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 21:30:37,459 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 21:30:37,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 21:30:37,459 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 21:30:37,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 21:30:37,460 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 21:30:37,460 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 21:30:37,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 21:30:37,460 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 21:30:37,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 21:30:37,461 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 21:30:37,461 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 21:30:37,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 21:30:37,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:30:37,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 21:30:37,462 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 21:30:37,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 21:30:37,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 21:30:37,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 21:30:37,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:37,462 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 21:30:37,463 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 21:30:37,463 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 21:30:37,464 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 21:30:37,464 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 21:30:37,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 21:30:37,510 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 21:30:37,514 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 21:30:37,515 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 21:30:37,515 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 21:30:37,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-06 21:30:37,843 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9721e5e00 [2018-04-06 21:30:37,973 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 21:30:37,973 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 21:30:37,974 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-06 21:30:37,975 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 21:30:37,976 INFO L215 ultiparseSymbolTable]: [2018-04-06 21:30:37,976 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 21:30:37,976 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-06 21:30:37,976 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 21:30:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-06 21:30:37,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-06 21:30:37,992 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9721e5e00 [2018-04-06 21:30:37,997 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 21:30:37,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 21:30:38,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 21:30:38,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 21:30:38,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 21:30:38,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:30:37" (1/1) ... [2018-04-06 21:30:38,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f21608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38, skipping insertion in model container [2018-04-06 21:30:38,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:30:37" (1/1) ... [2018-04-06 21:30:38,024 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:30:38,038 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:30:38,176 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:30:38,205 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:30:38,210 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-06 21:30:38,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38 WrapperNode [2018-04-06 21:30:38,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 21:30:38,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 21:30:38,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 21:30:38,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 21:30:38,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... [2018-04-06 21:30:38,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... [2018-04-06 21:30:38,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... [2018-04-06 21:30:38,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... [2018-04-06 21:30:38,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... [2018-04-06 21:30:38,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... [2018-04-06 21:30:38,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... [2018-04-06 21:30:38,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 21:30:38,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 21:30:38,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 21:30:38,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 21:30:38,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:30:38,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 21:30:38,326 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 21:30:38,326 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 21:30:38,326 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-06 21:30:38,326 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-06 21:30:38,326 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 21:30:38,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 21:30:38,328 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 21:30:38,779 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-06 21:30:38,791 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 21:30:38,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:30:38 BoogieIcfgContainer [2018-04-06 21:30:38,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 21:30:38,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 21:30:38,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 21:30:38,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 21:30:38,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:30:37" (1/3) ... [2018-04-06 21:30:38,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cece01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:30:38, skipping insertion in model container [2018-04-06 21:30:38,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:30:38" (2/3) ... [2018-04-06 21:30:38,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cece01f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:30:38, skipping insertion in model container [2018-04-06 21:30:38,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:30:38" (3/3) ... [2018-04-06 21:30:38,797 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-06 21:30:38,803 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 21:30:38,809 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-06 21:30:38,853 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 21:30:38,853 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 21:30:38,854 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 21:30:38,854 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 21:30:38,854 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 21:30:38,854 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 21:30:38,854 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 21:30:38,854 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 21:30:38,854 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 21:30:38,855 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 21:30:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-04-06 21:30:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-06 21:30:38,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:38,873 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:38,873 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970878, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:38,888 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:38,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:38,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:30:38,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:38,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:38,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:30:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:39,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:30:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:39,049 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:30:39,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 21:30:39,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 21:30:39,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 21:30:39,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:30:39,063 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-04-06 21:30:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:30:39,399 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-04-06 21:30:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:30:39,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-06 21:30:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:30:39,417 INFO L225 Difference]: With dead ends: 268 [2018-04-06 21:30:39,418 INFO L226 Difference]: Without dead ends: 243 [2018-04-06 21:30:39,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:30:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-06 21:30:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-06 21:30:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-06 21:30:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-06 21:30:39,474 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-04-06 21:30:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:30:39,475 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-06 21:30:39,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 21:30:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-06 21:30:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-06 21:30:39,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:39,477 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:39,477 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970879, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:39,490 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:39,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:39,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:30:39,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:39,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:39,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:30:39,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 21:30:39,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:39,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:30:39,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-06 21:30:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:39,568 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:30:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:39,620 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:30:39,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 21:30:39,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 21:30:39,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 21:30:39,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 21:30:39,623 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-04-06 21:30:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:30:39,810 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-04-06 21:30:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 21:30:39,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-04-06 21:30:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:30:39,813 INFO L225 Difference]: With dead ends: 233 [2018-04-06 21:30:39,813 INFO L226 Difference]: Without dead ends: 232 [2018-04-06 21:30:39,814 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 21:30:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-06 21:30:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-04-06 21:30:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-06 21:30:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-04-06 21:30:39,828 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-04-06 21:30:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:30:39,828 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-04-06 21:30:39,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 21:30:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-04-06 21:30:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-06 21:30:39,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:39,829 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:39,829 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970880, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:39,843 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:39,861 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:39,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:30:39,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:39,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:39,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:30:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:39,888 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:30:39,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:39,956 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:30:39,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 21:30:39,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 21:30:39,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 21:30:39,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:30:39,957 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-04-06 21:30:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:30:40,047 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-04-06 21:30:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 21:30:40,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-06 21:30:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:30:40,050 INFO L225 Difference]: With dead ends: 148 [2018-04-06 21:30:40,050 INFO L226 Difference]: Without dead ends: 126 [2018-04-06 21:30:40,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:30:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-06 21:30:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-06 21:30:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-06 21:30:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-04-06 21:30:40,061 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-04-06 21:30:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:30:40,062 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-04-06 21:30:40,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 21:30:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-04-06 21:30:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-06 21:30:40,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:40,063 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:40,063 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:40,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970881, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:40,071 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:40,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:40,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:30:40,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:40,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:40,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:30:40,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 21:30:40,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:40,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:30:40,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-06 21:30:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:40,126 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:30:40,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:40,481 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:30:40,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-06 21:30:40,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 21:30:40,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 21:30:40,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-06 21:30:40,483 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-04-06 21:30:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:30:40,544 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-06 21:30:40,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 21:30:40,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-06 21:30:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:30:40,547 INFO L225 Difference]: With dead ends: 126 [2018-04-06 21:30:40,547 INFO L226 Difference]: Without dead ends: 125 [2018-04-06 21:30:40,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-06 21:30:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-06 21:30:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-06 21:30:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-06 21:30:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-04-06 21:30:40,568 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-04-06 21:30:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:30:40,568 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-04-06 21:30:40,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 21:30:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-04-06 21:30:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 21:30:40,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:40,570 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:40,570 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2009038742, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:40,579 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:40,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:40,633 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:30:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:40,704 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:30:40,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 21:30:40,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 21:30:40,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 21:30:40,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:30:40,705 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-04-06 21:30:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:30:40,766 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-04-06 21:30:40,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 21:30:40,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-06 21:30:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:30:40,768 INFO L225 Difference]: With dead ends: 230 [2018-04-06 21:30:40,768 INFO L226 Difference]: Without dead ends: 129 [2018-04-06 21:30:40,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:30:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-06 21:30:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-06 21:30:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-06 21:30:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-04-06 21:30:40,777 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-04-06 21:30:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:30:40,778 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-04-06 21:30:40,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 21:30:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-04-06 21:30:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 21:30:40,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:40,779 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:40,780 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1651014666, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:40,793 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:40,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:40,848 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:30:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:40,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:30:40,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-06 21:30:40,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 21:30:40,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 21:30:40,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-06 21:30:40,945 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-04-06 21:30:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:30:41,016 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-06 21:30:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-06 21:30:41,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-06 21:30:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:30:41,018 INFO L225 Difference]: With dead ends: 242 [2018-04-06 21:30:41,018 INFO L226 Difference]: Without dead ends: 141 [2018-04-06 21:30:41,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-06 21:30:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-06 21:30:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-06 21:30:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-06 21:30:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-06 21:30:41,027 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-04-06 21:30:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:30:41,027 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-06 21:30:41,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 21:30:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-06 21:30:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-06 21:30:41,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:41,029 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:41,030 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash 264713398, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:41,038 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:41,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:41,099 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:30:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:30:41,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:30:41,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-06 21:30:41,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-06 21:30:41,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-06 21:30:41,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-04-06 21:30:41,249 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-04-06 21:30:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:30:41,306 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-04-06 21:30:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 21:30:41,307 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-06 21:30:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:30:41,308 INFO L225 Difference]: With dead ends: 254 [2018-04-06 21:30:41,308 INFO L226 Difference]: Without dead ends: 153 [2018-04-06 21:30:41,310 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=197, Unknown=0, NotChecked=0, Total=342 [2018-04-06 21:30:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-06 21:30:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-06 21:30:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-06 21:30:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-04-06 21:30:41,319 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-04-06 21:30:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:30:41,319 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-04-06 21:30:41,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-06 21:30:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-04-06 21:30:41,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-06 21:30:41,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:30:41,322 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:30:41,322 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-06 21:30:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1439447690, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:30:41,334 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:30:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:30:41,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:30:41,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-06 21:30:41,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:30:41,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-06 21:30:41,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-06 21:30:41,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-06 21:30:41,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-06 21:30:41,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-06 21:30:41,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-04-06 21:30:41,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-06 21:30:41,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-06 21:30:41,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 93 [2018-04-06 21:30:41,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-06 21:30:41,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-06 21:30:41,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 132 [2018-04-06 21:30:41,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-06 21:30:41,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-04-06 21:30:41,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 179 [2018-04-06 21:30:41,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-06 21:30:41,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-04-06 21:30:41,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 234 [2018-04-06 21:30:41,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-06 21:30:41,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-04-06 21:30:41,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:30:41,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 164 [2018-04-06 21:30:41,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:30:41,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-06 21:30:44,468 WARN L148 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-06 21:30:46,624 WARN L148 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-06 21:30:47,924 WARN L148 SmtUtils]: Spent 263ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-06 21:32:08,150 WARN L151 SmtUtils]: Spent 80120ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-04-06 21:32:08,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 126 [2018-04-06 21:32:08,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 149 [2018-04-06 21:32:08,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 114 [2018-04-06 21:32:08,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,401 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:08,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 139 [2018-04-06 21:32:08,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:08,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 172 [2018-04-06 21:32:08,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:08,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 215 [2018-04-06 21:32:08,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:08,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 266 [2018-04-06 21:32:08,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,602 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:08,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 325 [2018-04-06 21:32:08,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,700 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,734 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-04-06 21:32:08,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 381 [2018-04-06 21:32:08,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 445 [2018-04-06 21:32:08,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:08,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 544 [2018-04-06 21:32:08,945 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,072 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,135 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,231 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,269 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,300 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:09,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-06 21:32:09,631 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-04-06 21:32:09,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 137 [2018-04-06 21:32:09,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,857 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,861 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,874 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,887 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,888 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,890 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,897 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,899 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,900 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:32:09,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:32:09,980 INFO L303 Elim1Store]: Index analysis took 147 ms [2018-04-06 21:32:09,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 20 select indices, 20 select index equivalence classes, 53 disjoint index pairs (out of 190 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 566 [2018-04-06 21:32:09,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:32:10,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:10,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:32:10,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-04-06 21:32:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 143 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:32:10,435 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:32:13,187 WARN L148 SmtUtils]: Spent 2150ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-06 21:32:13,430 WARN L148 SmtUtils]: Spent 240ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-06 21:32:14,011 WARN L148 SmtUtils]: Spent 580ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-06 21:32:14,174 WARN L148 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-06 21:33:00,897 WARN L148 SmtUtils]: Spent 203ms on a formula simplification that was a NOOP. DAG size: 118 [2018-04-06 21:33:19,284 WARN L148 SmtUtils]: Spent 1331ms on a formula simplification that was a NOOP. DAG size: 121 [2018-04-06 21:33:35,145 WARN L148 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-06 21:33:55,656 WARN L148 SmtUtils]: Spent 2117ms on a formula simplification that was a NOOP. DAG size: 130 [2018-04-06 21:34:26,667 WARN L148 SmtUtils]: Spent 2299ms on a formula simplification that was a NOOP. DAG size: 136 [2018-04-06 21:34:53,203 WARN L148 SmtUtils]: Spent 9057ms on a formula simplification that was a NOOP. DAG size: 137 Received shutdown request... [2018-04-06 21:35:25,724 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-06 21:35:25,725 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 21:35:25,729 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 21:35:25,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:35:25 BoogieIcfgContainer [2018-04-06 21:35:25,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 21:35:25,730 INFO L168 Benchmark]: Toolchain (without parser) took 287732.92 ms. Allocated memory was 303.6 MB in the beginning and 539.5 MB in the end (delta: 235.9 MB). Free memory was 246.6 MB in the beginning and 376.8 MB in the end (delta: -130.2 MB). Peak memory consumption was 105.7 MB. Max. memory is 5.3 GB. [2018-04-06 21:35:25,731 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 303.6 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 21:35:25,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.06 ms. Allocated memory is still 303.6 MB. Free memory was 245.6 MB in the beginning and 235.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:35:25,732 INFO L168 Benchmark]: Boogie Preprocessor took 43.17 ms. Allocated memory is still 303.6 MB. Free memory was 235.6 MB in the beginning and 233.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:35:25,733 INFO L168 Benchmark]: RCFGBuilder took 524.88 ms. Allocated memory was 303.6 MB in the beginning and 461.4 MB in the end (delta: 157.8 MB). Free memory was 233.6 MB in the beginning and 410.8 MB in the end (delta: -177.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:35:25,733 INFO L168 Benchmark]: TraceAbstraction took 286937.28 ms. Allocated memory was 461.4 MB in the beginning and 539.5 MB in the end (delta: 78.1 MB). Free memory was 410.8 MB in the beginning and 376.8 MB in the end (delta: 34.0 MB). Peak memory consumption was 112.1 MB. Max. memory is 5.3 GB. [2018-04-06 21:35:25,736 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.27 ms. Allocated memory is still 303.6 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.06 ms. Allocated memory is still 303.6 MB. Free memory was 245.6 MB in the beginning and 235.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.17 ms. Allocated memory is still 303.6 MB. Free memory was 235.6 MB in the beginning and 233.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 524.88 ms. Allocated memory was 303.6 MB in the beginning and 461.4 MB in the end (delta: 157.8 MB). Free memory was 233.6 MB in the beginning and 410.8 MB in the end (delta: -177.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 286937.28 ms. Allocated memory was 461.4 MB in the beginning and 539.5 MB in the end (delta: 78.1 MB). Free memory was 410.8 MB in the beginning and 376.8 MB in the end (delta: 34.0 MB). Peak memory consumption was 112.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 286.8s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 750 SDslu, 1125 SDs, 0 SdLazy, 376 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 382 ConstructedInterpolants, 12 QuantifiedInterpolants, 34110 SizeOfPredicates, 12 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_21-35-25-745.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_21-35-25-745.csv Completed graceful shutdown