java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cf7e2d-m [2018-03-29 21:35:09,432 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 21:35:09,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 21:35:09,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 21:35:09,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 21:35:09,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 21:35:09,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 21:35:09,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 21:35:09,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 21:35:09,453 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 21:35:09,454 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 21:35:09,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 21:35:09,455 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 21:35:09,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 21:35:09,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 21:35:09,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 21:35:09,462 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 21:35:09,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 21:35:09,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 21:35:09,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 21:35:09,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 21:35:09,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 21:35:09,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 21:35:09,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 21:35:09,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 21:35:09,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 21:35:09,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 21:35:09,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 21:35:09,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 21:35:09,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 21:35:09,475 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 21:35:09,475 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-29 21:35:09,499 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 21:35:09,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 21:35:09,500 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 21:35:09,500 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 21:35:09,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 21:35:09,501 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 21:35:09,501 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 21:35:09,501 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 21:35:09,501 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 21:35:09,502 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 21:35:09,502 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 21:35:09,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 21:35:09,502 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 21:35:09,502 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 21:35:09,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 21:35:09,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 21:35:09,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 21:35:09,503 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 21:35:09,503 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 21:35:09,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 21:35:09,503 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 21:35:09,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 21:35:09,504 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 21:35:09,504 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 21:35:09,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 21:35:09,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:35:09,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 21:35:09,505 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 21:35:09,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 21:35:09,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 21:35:09,505 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 21:35:09,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:09,505 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 21:35:09,506 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 21:35:09,506 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 21:35:09,507 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 21:35:09,507 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 21:35:09,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 21:35:09,552 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 21:35:09,555 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 21:35:09,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 21:35:09,557 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 21:35:09,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_false-valid-deref.i [2018-03-29 21:35:09,874 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG82867138b [2018-03-29 21:35:10,011 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 21:35:10,012 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 21:35:10,012 INFO L168 CDTParser]: Scanning test-bitfields-2_false-valid-deref.i [2018-03-29 21:35:10,013 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 21:35:10,013 INFO L215 ultiparseSymbolTable]: [2018-03-29 21:35:10,013 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 21:35:10,013 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_false-valid-deref.i [2018-03-29 21:35:10,014 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 21:35:10,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-2_false-valid-deref.i [2018-03-29 21:35:10,014 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-2_false-valid-deref.i [2018-03-29 21:35:10,029 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG82867138b [2018-03-29 21:35:10,034 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 21:35:10,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 21:35:10,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 21:35:10,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 21:35:10,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 21:35:10,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af07408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10, skipping insertion in model container [2018-03-29 21:35:10,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,064 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:35:10,075 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:35:10,212 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:35:10,236 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:35:10,242 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-29 21:35:10,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10 WrapperNode [2018-03-29 21:35:10,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 21:35:10,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 21:35:10,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 21:35:10,257 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 21:35:10,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... [2018-03-29 21:35:10,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 21:35:10,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 21:35:10,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 21:35:10,296 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 21:35:10,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:35:10,351 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 21:35:10,351 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 21:35:10,351 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 21:35:10,351 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-29 21:35:10,351 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-29 21:35:10,352 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 21:35:10,352 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 21:35:10,352 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 21:35:10,352 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 21:35:10,352 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-29 21:35:10,352 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 21:35:10,353 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 21:35:10,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 21:35:10,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 21:35:10,353 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 21:35:10,353 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 21:35:10,741 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-29 21:35:10,777 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 21:35:10,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:35:10 BoogieIcfgContainer [2018-03-29 21:35:10,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 21:35:10,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 21:35:10,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 21:35:10,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 21:35:10,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 09:35:10" (1/3) ... [2018-03-29 21:35:10,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c610175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:35:10, skipping insertion in model container [2018-03-29 21:35:10,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:10" (2/3) ... [2018-03-29 21:35:10,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c610175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:35:10, skipping insertion in model container [2018-03-29 21:35:10,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:35:10" (3/3) ... [2018-03-29 21:35:10,785 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_false-valid-deref.i [2018-03-29 21:35:10,794 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 21:35:10,800 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-03-29 21:35:10,838 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 21:35:10,839 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 21:35:10,839 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 21:35:10,839 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 21:35:10,840 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 21:35:10,840 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 21:35:10,840 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 21:35:10,840 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 21:35:10,840 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 21:35:10,841 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 21:35:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-03-29 21:35:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-29 21:35:10,863 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:10,864 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:10,864 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash -506314848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:10,879 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:10,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:10,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:10,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:10,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:10,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:35:10,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 21:35:10,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:11,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:35:11,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-29 21:35:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:11,025 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:11,095 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:11,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 21:35:11,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 21:35:11,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 21:35:11,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 21:35:11,116 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-03-29 21:35:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:11,255 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-03-29 21:35:11,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:35:11,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-03-29 21:35:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:11,271 INFO L225 Difference]: With dead ends: 160 [2018-03-29 21:35:11,271 INFO L226 Difference]: Without dead ends: 151 [2018-03-29 21:35:11,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 21:35:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-03-29 21:35:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-03-29 21:35:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-29 21:35:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-03-29 21:35:11,323 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-03-29 21:35:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:11,324 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-03-29 21:35:11,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 21:35:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-03-29 21:35:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-29 21:35:11,325 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:11,325 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:11,325 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash -506314847, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:11,335 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:11,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:11,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:11,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:11,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:11,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:35:11,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 21:35:11,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:11,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:35:11,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-03-29 21:35:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:11,451 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:11,817 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:11,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-03-29 21:35:11,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 21:35:11,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 21:35:11,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-29 21:35:11,820 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 5 states. [2018-03-29 21:35:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:11,893 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-03-29 21:35:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:35:11,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-03-29 21:35:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:11,894 INFO L225 Difference]: With dead ends: 102 [2018-03-29 21:35:11,894 INFO L226 Difference]: Without dead ends: 96 [2018-03-29 21:35:11,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-29 21:35:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-29 21:35:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-03-29 21:35:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-29 21:35:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-03-29 21:35:11,906 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-03-29 21:35:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:11,906 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-03-29 21:35:11,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 21:35:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-03-29 21:35:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:35:11,907 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:11,908 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:11,908 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash 51854364, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:11,920 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:11,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:11,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:11,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:11,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:11,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:35:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:11,994 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:12,060 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:12,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:35:12,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:35:12,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:35:12,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:35:12,061 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-03-29 21:35:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:12,203 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-03-29 21:35:12,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 21:35:12,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-29 21:35:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:12,204 INFO L225 Difference]: With dead ends: 96 [2018-03-29 21:35:12,204 INFO L226 Difference]: Without dead ends: 84 [2018-03-29 21:35:12,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-29 21:35:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-29 21:35:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-03-29 21:35:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-03-29 21:35:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-03-29 21:35:12,211 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2018-03-29 21:35:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:12,212 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-03-29 21:35:12,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:35:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-03-29 21:35:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:35:12,212 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:12,212 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:12,213 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash 51854362, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:12,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:12,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:12,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:12,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:35:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:12,259 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:12,285 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:12,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:35:12,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:35:12,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:35:12,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:35:12,286 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 4 states. [2018-03-29 21:35:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:12,366 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-03-29 21:35:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:35:12,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-29 21:35:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:12,367 INFO L225 Difference]: With dead ends: 126 [2018-03-29 21:35:12,367 INFO L226 Difference]: Without dead ends: 114 [2018-03-29 21:35:12,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-29 21:35:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-03-29 21:35:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2018-03-29 21:35:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-03-29 21:35:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-03-29 21:35:12,373 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-03-29 21:35:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:12,373 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-03-29 21:35:12,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:35:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-03-29 21:35:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-29 21:35:12,374 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:12,374 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:12,374 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2075956322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:12,381 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:12,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:12,424 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:12,492 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:12,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-29 21:35:12,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:35:12,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:35:12,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:35:12,494 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-03-29 21:35:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:12,519 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-03-29 21:35:12,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 21:35:12,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-03-29 21:35:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:12,521 INFO L225 Difference]: With dead ends: 143 [2018-03-29 21:35:12,521 INFO L226 Difference]: Without dead ends: 87 [2018-03-29 21:35:12,521 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-03-29 21:35:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-03-29 21:35:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-03-29 21:35:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-29 21:35:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-03-29 21:35:12,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 37 [2018-03-29 21:35:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:12,530 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-03-29 21:35:12,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:35:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-03-29 21:35:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-29 21:35:12,532 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:12,532 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:12,532 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1900445346, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:12,538 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:12,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:12,585 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:12,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:35:12,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-29 21:35:12,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 21:35:12,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 21:35:12,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-03-29 21:35:12,657 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 10 states. [2018-03-29 21:35:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:12,696 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-03-29 21:35:12,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-29 21:35:12,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-03-29 21:35:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:12,698 INFO L225 Difference]: With dead ends: 152 [2018-03-29 21:35:12,698 INFO L226 Difference]: Without dead ends: 96 [2018-03-29 21:35:12,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-03-29 21:35:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-29 21:35:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-03-29 21:35:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-29 21:35:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-03-29 21:35:12,707 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 43 [2018-03-29 21:35:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:12,707 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-03-29 21:35:12,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 21:35:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-03-29 21:35:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 21:35:12,709 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:12,709 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:12,709 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1778096232, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:12,722 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:12,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:12,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-29 21:35:12,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-29 21:35:12,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-03-29 21:35:12,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-29 21:35:12,802 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,803 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-03-29 21:35:12,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-03-29 21:35:12,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-29 21:35:12,835 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,836 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,837 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,838 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,838 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,839 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-03-29 21:35:12,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-03-29 21:35:12,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-03-29 21:35:12,875 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,875 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,876 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,876 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,877 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,877 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,878 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,879 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,879 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,880 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,880 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,881 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-03-29 21:35:12,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-03-29 21:35:12,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-03-29 21:35:12,945 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,946 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,946 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,947 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,948 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,948 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,949 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,949 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,950 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,951 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,952 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,952 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,953 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,954 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,954 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,955 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,956 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,956 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,957 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,958 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:12,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-03-29 21:35:12,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:12,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:13,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:13,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-03-29 21:35:13,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-03-29 21:35:13,028 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,029 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,030 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,030 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,031 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,031 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,032 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,032 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,033 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,033 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,034 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,035 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,035 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,036 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,036 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,037 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,037 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,038 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,038 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,039 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:13,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-03-29 21:35:13,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:13,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:13,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:13,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-03-29 21:35:14,163 WARN L151 SmtUtils]: Spent 556ms on a formula simplification. DAG size of input: 161 DAG size of output 40 [2018-03-29 21:35:14,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 81 [2018-03-29 21:35:14,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2018-03-29 21:35:14,224 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,225 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2018-03-29 21:35:14,233 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,234 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,236 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,237 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2018-03-29 21:35:14,244 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,245 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,246 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,247 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,248 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,249 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 165 [2018-03-29 21:35:14,258 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,259 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,261 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,262 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 214 [2018-03-29 21:35:14,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,307 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,318 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-29 21:35:14,458 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:375, output treesize:108 [2018-03-29 21:35:14,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 82 [2018-03-29 21:35:14,539 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,539 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:14,541 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,542 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,543 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,545 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,547 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,549 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,551 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,551 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:14,554 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,555 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:14,556 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,557 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:14,558 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,559 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:14,577 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,584 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,584 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,585 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:14,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 175 [2018-03-29 21:35:14,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 21:35:14,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:14,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:7 [2018-03-29 21:35:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:14,720 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:14,901 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 68 [2018-03-29 21:35:16,132 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 99 DAG size of output 85 [2018-03-29 21:35:16,816 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-03-29 21:35:17,523 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 98 [2018-03-29 21:35:18,504 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-03-29 21:35:19,047 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 21:35:19,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:19,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:19,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:552, output treesize:1 [2018-03-29 21:35:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:19,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:35:19,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 40 [2018-03-29 21:35:19,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-03-29 21:35:19,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-03-29 21:35:19,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1305, Unknown=10, NotChecked=0, Total=1560 [2018-03-29 21:35:19,105 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 40 states. [2018-03-29 21:35:24,069 WARN L151 SmtUtils]: Spent 2650ms on a formula simplification. DAG size of input: 200 DAG size of output 146 [2018-03-29 21:35:25,488 WARN L151 SmtUtils]: Spent 726ms on a formula simplification. DAG size of input: 144 DAG size of output 120 [2018-03-29 21:35:28,809 WARN L151 SmtUtils]: Spent 2079ms on a formula simplification. DAG size of input: 180 DAG size of output 151 [2018-03-29 21:35:30,621 WARN L151 SmtUtils]: Spent 941ms on a formula simplification. DAG size of input: 137 DAG size of output 129 [2018-03-29 21:35:33,001 WARN L151 SmtUtils]: Spent 1243ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-03-29 21:35:34,078 WARN L148 SmtUtils]: Spent 392ms on a formula simplification that was a NOOP. DAG size: 122 [2018-03-29 21:35:35,609 WARN L151 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 116 DAG size of output 115 [2018-03-29 21:35:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:37,409 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-03-29 21:35:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-03-29 21:35:37,409 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-03-29 21:35:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:37,413 INFO L225 Difference]: With dead ends: 313 [2018-03-29 21:35:37,413 INFO L226 Difference]: Without dead ends: 266 [2018-03-29 21:35:37,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=735, Invalid=4367, Unknown=10, NotChecked=0, Total=5112 [2018-03-29 21:35:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-03-29 21:35:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 116. [2018-03-29 21:35:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-03-29 21:35:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-03-29 21:35:37,432 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 52 [2018-03-29 21:35:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:37,432 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-03-29 21:35:37,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-03-29 21:35:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-03-29 21:35:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 21:35:37,434 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:37,434 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:37,434 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-29 21:35:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash -248522691, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:37,440 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:37,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:37,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:37,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:35:37,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 21:35:37,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-29 21:35:37,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-29 21:35:37,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-29 21:35:37,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-03-29 21:35:37,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-29 21:35:37,531 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,532 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-03-29 21:35:37,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-03-29 21:35:37,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-03-29 21:35:37,566 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,567 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,567 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,568 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,568 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,569 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-03-29 21:35:37,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-03-29 21:35:37,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-03-29 21:35:37,604 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,604 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,605 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,606 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,606 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,607 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,608 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,609 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,610 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,610 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,611 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,612 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-03-29 21:35:37,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-03-29 21:35:37,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-03-29 21:35:37,662 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,663 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,663 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,664 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,664 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,665 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,665 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,666 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,666 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,667 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,667 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,668 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:37,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-03-29 21:35:37,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:37,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-03-29 21:35:38,377 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 176 DAG size of output 57 [2018-03-29 21:35:38,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2018-03-29 21:35:38,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-03-29 21:35:38,400 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67 [2018-03-29 21:35:38,409 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,413 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,419 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 97 [2018-03-29 21:35:38,424 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,425 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,426 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,428 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,429 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,436 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,438 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 149 [2018-03-29 21:35:38,443 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,444 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,445 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,446 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,447 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,447 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,449 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,451 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,457 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,458 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 240 [2018-03-29 21:35:38,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-29 21:35:38,570 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:419, output treesize:130 [2018-03-29 21:35:38,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 91 [2018-03-29 21:35:38,682 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,684 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,685 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,685 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:38,686 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,687 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,688 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,689 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,690 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,690 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:38,691 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,692 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,693 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,694 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,695 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,696 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,697 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,698 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:38,699 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,699 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:38,701 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,703 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,704 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,707 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,708 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,710 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 249 [2018-03-29 21:35:38,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,771 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,772 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,773 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,774 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,774 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,775 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,776 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,777 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,777 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:35:38,778 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,779 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,779 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,780 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,783 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,784 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:38,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 87 [2018-03-29 21:35:38,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:38,808 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:139, output treesize:3 [2018-03-29 21:35:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:38,877 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:36:22,767 WARN L148 SmtUtils]: Spent 2045ms on a formula simplification that was a NOOP. DAG size: 85 [2018-03-29 21:36:54,517 WARN L148 SmtUtils]: Spent 299ms on a formula simplification that was a NOOP. DAG size: 91 Received shutdown request... [2018-03-29 21:37:58,354 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-29 21:37:58,354 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 21:37:58,358 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 21:37:58,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 09:37:58 BoogieIcfgContainer [2018-03-29 21:37:58,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 21:37:58,359 INFO L168 Benchmark]: Toolchain (without parser) took 168325.02 ms. Allocated memory was 307.8 MB in the beginning and 580.9 MB in the end (delta: 273.2 MB). Free memory was 250.8 MB in the beginning and 321.5 MB in the end (delta: -70.7 MB). Peak memory consumption was 202.4 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:58,360 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 21:37:58,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.60 ms. Allocated memory is still 307.8 MB. Free memory was 250.8 MB in the beginning and 239.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:58,361 INFO L168 Benchmark]: Boogie Preprocessor took 38.82 ms. Allocated memory is still 307.8 MB. Free memory was 239.6 MB in the beginning and 238.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-03-29 21:37:58,361 INFO L168 Benchmark]: RCFGBuilder took 482.52 ms. Allocated memory was 307.8 MB in the beginning and 472.4 MB in the end (delta: 164.6 MB). Free memory was 238.6 MB in the beginning and 429.9 MB in the end (delta: -191.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:58,362 INFO L168 Benchmark]: TraceAbstraction took 167579.84 ms. Allocated memory was 472.4 MB in the beginning and 580.9 MB in the end (delta: 108.5 MB). Free memory was 429.9 MB in the beginning and 321.5 MB in the end (delta: 108.3 MB). Peak memory consumption was 216.9 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:58,364 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.17 ms. Allocated memory is still 307.8 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.60 ms. Allocated memory is still 307.8 MB. Free memory was 250.8 MB in the beginning and 239.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.82 ms. Allocated memory is still 307.8 MB. Free memory was 239.6 MB in the beginning and 238.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 482.52 ms. Allocated memory was 307.8 MB in the beginning and 472.4 MB in the end (delta: 164.6 MB). Free memory was 238.6 MB in the beginning and 429.9 MB in the end (delta: -191.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 167579.84 ms. Allocated memory was 472.4 MB in the beginning and 580.9 MB in the end (delta: 108.5 MB). Free memory was 429.9 MB in the beginning and 321.5 MB in the end (delta: 108.3 MB). Peak memory consumption was 216.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 56 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 167.5s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 18.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 472 SDtfs, 1931 SDslu, 1358 SDs, 0 SdLazy, 1286 SolverSat, 368 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 335 SyntacticMatches, 10 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 230 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 44 QuantifiedInterpolants, 986432 SizeOfPredicates, 21 NumberOfNonLiveVariables, 730 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-29_21-37-58-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-29_21-37-58-379.csv Completed graceful shutdown