java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cf7e2d-m [2018-03-29 21:32:11,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 21:32:11,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 21:32:11,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 21:32:11,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 21:32:11,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 21:32:11,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 21:32:11,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 21:32:11,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 21:32:11,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 21:32:11,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 21:32:11,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 21:32:11,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 21:32:11,808 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 21:32:11,809 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 21:32:11,812 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 21:32:11,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 21:32:11,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 21:32:11,817 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 21:32:11,818 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 21:32:11,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 21:32:11,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 21:32:11,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 21:32:11,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 21:32:11,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 21:32:11,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 21:32:11,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 21:32:11,826 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 21:32:11,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 21:32:11,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 21:32:11,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 21:32:11,827 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:32:11,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 21:32:11,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 21:32:11,853 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 21:32:11,853 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 21:32:11,853 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 21:32:11,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 21:32:11,854 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 21:32:11,854 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 21:32:11,854 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 21:32:11,854 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 21:32:11,854 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 21:32:11,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 21:32:11,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 21:32:11,855 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 21:32:11,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 21:32:11,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 21:32:11,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 21:32:11,856 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 21:32:11,856 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 21:32:11,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 21:32:11,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 21:32:11,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 21:32:11,856 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 21:32:11,857 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 21:32:11,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 21:32:11,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:32:11,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 21:32:11,857 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 21:32:11,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 21:32:11,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 21:32:11,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 21:32:11,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:32:11,858 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 21:32:11,859 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 21:32:11,859 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 21:32:11,859 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 21:32:11,860 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 21:32:11,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 21:32:11,905 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 21:32:11,908 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 21:32:11,910 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 21:32:11,910 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 21:32:11,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-29 21:32:12,280 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1be537616 [2018-03-29 21:32:12,401 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 21:32:12,401 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 21:32:12,402 INFO L168 CDTParser]: Scanning test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-29 21:32:12,403 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 21:32:12,403 INFO L215 ultiparseSymbolTable]: [2018-03-29 21:32:12,403 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 21:32:12,403 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-29 21:32:12,403 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 21:32:12,403 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-29 21:32:12,404 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-29 21:32:12,418 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1be537616 [2018-03-29 21:32:12,423 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 21:32:12,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 21:32:12,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 21:32:12,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 21:32:12,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 21:32:12,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6818f652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12, skipping insertion in model container [2018-03-29 21:32:12,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,451 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:32:12,464 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:32:12,604 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:32:12,630 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:32:12,635 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-29 21:32:12,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12 WrapperNode [2018-03-29 21:32:12,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 21:32:12,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 21:32:12,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 21:32:12,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 21:32:12,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (1/1) ... [2018-03-29 21:32:12,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 21:32:12,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 21:32:12,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 21:32:12,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 21:32:12,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (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:32:12,745 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 21:32:12,746 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 21:32:12,746 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 21:32:12,746 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-29 21:32:12,746 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-29 21:32:12,746 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 21:32:12,747 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 21:32:12,747 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 21:32:12,747 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 21:32:12,747 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-29 21:32:12,747 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 21:32:12,747 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 21:32:12,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 21:32:12,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 21:32:12,748 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 21:32:12,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 21:32:13,148 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-29 21:32:13,185 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 21:32:13,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:32:13 BoogieIcfgContainer [2018-03-29 21:32:13,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 21:32:13,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 21:32:13,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 21:32:13,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 21:32:13,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 09:32:12" (1/3) ... [2018-03-29 21:32:13,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2927d683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:32:13, skipping insertion in model container [2018-03-29 21:32:13,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:32:12" (2/3) ... [2018-03-29 21:32:13,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2927d683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:32:13, skipping insertion in model container [2018-03-29 21:32:13,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:32:13" (3/3) ... [2018-03-29 21:32:13,191 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-29 21:32:13,198 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 21:32:13,204 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-03-29 21:32:13,249 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 21:32:13,250 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 21:32:13,250 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 21:32:13,250 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 21:32:13,250 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 21:32:13,250 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 21:32:13,250 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 21:32:13,250 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 21:32:13,250 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 21:32:13,251 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 21:32:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-03-29 21:32:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-29 21:32:13,270 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:32:13,271 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:32:13,271 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:32:13,274 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:32:13,286 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:32:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:32:13,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:32:13,375 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:32:13,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:32:13,412 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:32:13,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,420 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:32:13,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-29 21:32:13,429 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:32:13,429 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:32:13,481 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:32:13,506 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:32:13,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 21:32:13,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 21:32:13,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 21:32:13,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 21:32:13,522 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-03-29 21:32:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:32:13,676 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-03-29 21:32:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:32:13,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-03-29 21:32:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:32:13,693 INFO L225 Difference]: With dead ends: 160 [2018-03-29 21:32:13,693 INFO L226 Difference]: Without dead ends: 151 [2018-03-29 21:32:13,697 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:32:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-03-29 21:32:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-03-29 21:32:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-29 21:32:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-03-29 21:32:13,746 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-03-29 21:32:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:32:13,747 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-03-29 21:32:13,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 21:32:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-03-29 21:32:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-29 21:32:13,748 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:32:13,748 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:32:13,748 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:32:13,748 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:32:13,762 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:32:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:32:13,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:32:13,794 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:32:13,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,819 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:32:13,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 21:32:13,874 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:13,875 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:13,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-03-29 21:32:13,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,888 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:13,889 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:13,890 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:32:13,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:13,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:32:13,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-03-29 21:32:13,917 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:32:13,918 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:32:14,153 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:32:14,175 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:32:14,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:32:14,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:32:14,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:32:14,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:32:14,178 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 6 states. [2018-03-29 21:32:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:32:14,395 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-03-29 21:32:14,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:32:14,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-03-29 21:32:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:32:14,398 INFO L225 Difference]: With dead ends: 151 [2018-03-29 21:32:14,398 INFO L226 Difference]: Without dead ends: 145 [2018-03-29 21:32:14,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-03-29 21:32:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-03-29 21:32:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-03-29 21:32:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-29 21:32:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-03-29 21:32:14,410 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-03-29 21:32:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:32:14,411 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-03-29 21:32:14,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:32:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-03-29 21:32:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:32:14,412 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:32:14,412 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:32:14,413 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:32:14,413 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:32:14,419 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:32:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:32:14,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:32:14,442 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:32:14,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:14,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:14,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:32:14,458 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:32:14,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:32:14,498 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:32:14,520 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:32:14,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:32:14,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:32:14,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:32:14,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:32:14,521 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-03-29 21:32:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:32:14,596 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-03-29 21:32:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 21:32:14,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-29 21:32:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:32:14,597 INFO L225 Difference]: With dead ends: 96 [2018-03-29 21:32:14,597 INFO L226 Difference]: Without dead ends: 72 [2018-03-29 21:32:14,598 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:32:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-03-29 21:32:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-03-29 21:32:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-29 21:32:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-29 21:32:14,605 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2018-03-29 21:32:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:32:14,606 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-29 21:32:14,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:32:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-29 21:32:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:32:14,607 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:32:14,607 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:32:14,608 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:32:14,608 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:32:14,615 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:32:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:32:14,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:32:14,636 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:32:14,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:14,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:14,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:32:14,651 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:32:14,652 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:32:14,655 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:32:14,677 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:32:14,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:32:14,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:32:14,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:32:14,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:32:14,677 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2018-03-29 21:32:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:32:14,766 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-03-29 21:32:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:32:14,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-29 21:32:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:32:14,768 INFO L225 Difference]: With dead ends: 103 [2018-03-29 21:32:14,768 INFO L226 Difference]: Without dead ends: 93 [2018-03-29 21:32:14,768 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:32:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-03-29 21:32:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2018-03-29 21:32:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-03-29 21:32:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-03-29 21:32:14,776 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 21 [2018-03-29 21:32:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:32:14,776 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-03-29 21:32:14,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:32:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-03-29 21:32:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-29 21:32:14,777 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:32:14,778 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:32:14,778 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:32:14,778 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:32:14,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:32:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:32:14,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:32:14,849 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:32:14,849 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:32:14,895 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:32:14,917 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:32:14,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-29 21:32:14,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:32:14,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:32:14,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:32:14,918 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-03-29 21:32:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:32:14,951 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-03-29 21:32:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 21:32:14,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-03-29 21:32:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:32:14,952 INFO L225 Difference]: With dead ends: 117 [2018-03-29 21:32:14,953 INFO L226 Difference]: Without dead ends: 74 [2018-03-29 21:32:14,953 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:32:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-03-29 21:32:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-03-29 21:32:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-03-29 21:32:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-03-29 21:32:14,961 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 37 [2018-03-29 21:32:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:32:14,962 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-03-29 21:32:14,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:32:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-03-29 21:32:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-29 21:32:14,963 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:32:14,964 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:32:14,964 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:32:14,964 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:32:14,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:32:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:32:15,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:32:15,026 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:32:15,026 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:32:15,098 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:32:15,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:32:15,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-29 21:32:15,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 21:32:15,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 21:32:15,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-03-29 21:32:15,121 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-03-29 21:32:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:32:15,162 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-03-29 21:32:15,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-29 21:32:15,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-03-29 21:32:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:32:15,164 INFO L225 Difference]: With dead ends: 123 [2018-03-29 21:32:15,164 INFO L226 Difference]: Without dead ends: 80 [2018-03-29 21:32:15,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-03-29 21:32:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-03-29 21:32:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-03-29 21:32:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-03-29 21:32:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-03-29 21:32:15,170 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 43 [2018-03-29 21:32:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:32:15,170 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-03-29 21:32:15,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 21:32:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-03-29 21:32:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-03-29 21:32:15,171 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:32:15,171 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:32:15,171 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:32:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 130529506, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:32:15,177 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:32:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:32:15,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:32:15,228 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:32:15,230 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:32:15,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-03-29 21:32:15,245 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:32:15,247 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,248 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,248 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:32:15,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-03-29 21:32:15,270 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:32:15,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,274 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,275 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,275 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,276 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,277 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:32:15,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-03-29 21:32:15,315 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:32:15,317 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,318 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,319 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,319 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,320 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,322 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,322 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,323 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,324 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,324 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,325 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:32:15,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-03-29 21:32:15,378 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:32:15,382 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,386 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,387 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,389 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,390 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,391 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,391 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,392 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,393 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,394 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,394 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,395 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,396 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,397 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,397 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,398 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,399 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,400 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,401 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:32:15,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-03-29 21:32:15,487 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:32:15,494 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,494 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,495 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,496 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,497 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,498 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,498 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,499 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,500 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,501 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,501 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,502 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,503 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,504 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,504 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,505 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,506 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,510 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,511 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,512 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:15,513 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:32:15,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:15,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-03-29 21:32:16,221 WARN L151 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 103 DAG size of output 42 [2018-03-29 21:32:16,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 74 [2018-03-29 21:32:16,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2018-03-29 21:32:16,261 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,262 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2018-03-29 21:32:16,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,274 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 76 [2018-03-29 21:32:16,283 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,285 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,286 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,287 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,288 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 105 [2018-03-29 21:32:16,296 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:16,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:16,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:16,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:16,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:16,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-03-29 21:32:16,418 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:212, output treesize:100 [2018-03-29 21:32:16,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2018-03-29 21:32:16,477 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,479 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,480 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:32:16,481 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,482 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,486 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,488 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,489 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,489 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:32:16,491 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,495 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,498 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,507 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,508 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:32:16,521 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,522 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:32:16,549 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,551 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:32:16,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 180 [2018-03-29 21:32:16,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 12 xjuncts. [2018-03-29 21:32:16,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:16,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:32:16,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:107, output treesize:7 [2018-03-29 21:32:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:32:16,740 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:32:21,600 WARN L148 SmtUtils]: Spent 515ms on a formula simplification that was a NOOP. DAG size: 77 [2018-03-29 21:32:27,114 WARN L148 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 83 [2018-03-29 21:32:36,081 WARN L148 SmtUtils]: Spent 2052ms on a formula simplification that was a NOOP. DAG size: 89 [2018-03-29 21:32:43,743 WARN L148 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 83 [2018-03-29 21:32:46,189 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-03-29 21:32:46,190 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:448, output treesize:1 [2018-03-29 21:32:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:32:46,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:32:46,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2018-03-29 21:32:46,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-03-29 21:32:46,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-03-29 21:32:46,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1107, Unknown=19, NotChecked=0, Total=1332 [2018-03-29 21:32:46,271 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 37 states. [2018-03-29 21:33:18,804 WARN L151 SmtUtils]: Spent 28609ms on a formula simplification. DAG size of input: 169 DAG size of output 148 [2018-03-29 21:33:38,286 WARN L151 SmtUtils]: Spent 8398ms on a formula simplification. DAG size of input: 133 DAG size of output 124 [2018-03-29 21:34:48,110 WARN L151 SmtUtils]: Spent 52154ms on a formula simplification. DAG size of input: 136 DAG size of output 119 Received shutdown request... [2018-03-29 21:35:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-29 21:35:00,755 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 21:35:00,760 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 21:35:00,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 09:35:00 BoogieIcfgContainer [2018-03-29 21:35:00,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 21:35:00,761 INFO L168 Benchmark]: Toolchain (without parser) took 168337.89 ms. Allocated memory was 301.5 MB in the beginning and 547.9 MB in the end (delta: 246.4 MB). Free memory was 244.7 MB in the beginning and 370.2 MB in the end (delta: -125.6 MB). Peak memory consumption was 120.9 MB. Max. memory is 5.3 GB. [2018-03-29 21:35:00,762 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 301.5 MB. Free memory is still 263.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 21:35:00,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.50 ms. Allocated memory is still 301.5 MB. Free memory was 243.7 MB in the beginning and 233.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-03-29 21:35:00,763 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 301.5 MB. Free memory was 233.5 MB in the beginning and 231.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:35:00,763 INFO L168 Benchmark]: RCFGBuilder took 494.86 ms. Allocated memory was 301.5 MB in the beginning and 460.8 MB in the end (delta: 159.4 MB). Free memory was 231.5 MB in the beginning and 417.8 MB in the end (delta: -186.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-03-29 21:35:00,763 INFO L168 Benchmark]: TraceAbstraction took 167574.13 ms. Allocated memory was 460.8 MB in the beginning and 547.9 MB in the end (delta: 87.0 MB). Free memory was 417.8 MB in the beginning and 370.2 MB in the end (delta: 47.5 MB). Peak memory consumption was 134.6 MB. Max. memory is 5.3 GB. [2018-03-29 21:35:00,765 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 301.5 MB. Free memory is still 263.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.50 ms. Allocated memory is still 301.5 MB. Free memory was 243.7 MB in the beginning and 233.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.57 ms. Allocated memory is still 301.5 MB. Free memory was 233.5 MB in the beginning and 231.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 494.86 ms. Allocated memory was 301.5 MB in the beginning and 460.8 MB in the end (delta: 159.4 MB). Free memory was 231.5 MB in the beginning and 417.8 MB in the end (delta: -186.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 167574.13 ms. Allocated memory was 460.8 MB in the beginning and 547.9 MB in the end (delta: 87.0 MB). Free memory was 417.8 MB in the beginning and 370.2 MB in the end (delta: 47.5 MB). Peak memory consumption was 134.6 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 constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 24 states, 37 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 111. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 167.5s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 135.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 375 SDtfs, 748 SDslu, 616 SDs, 0 SdLazy, 810 SolverSat, 152 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 334 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 140.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 121 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 392 ConstructedInterpolants, 45 QuantifiedInterpolants, 456488 SizeOfPredicates, 23 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-29_21-35-00-775.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-29_21-35-00-775.csv Completed graceful shutdown