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/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 21:14:04,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 21:14:04,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 21:14:04,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 21:14:04,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 21:14:05,000 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 21:14:05,000 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 21:14:05,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 21:14:05,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 21:14:05,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 21:14:05,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 21:14:05,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 21:14:05,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 21:14:05,009 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 21:14:05,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 21:14:05,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 21:14:05,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 21:14:05,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 21:14:05,017 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 21:14:05,018 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 21:14:05,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 21:14:05,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 21:14:05,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 21:14:05,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 21:14:05,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 21:14:05,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 21:14:05,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 21:14:05,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 21:14:05,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 21:14:05,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 21:14:05,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 21:14:05,027 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 21:14:05,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 21:14:05,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 21:14:05,049 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 21:14:05,049 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 21:14:05,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 21:14:05,050 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 21:14:05,050 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 21:14:05,050 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 21:14:05,050 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 21:14:05,050 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 21:14:05,051 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 21:14:05,051 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 21:14:05,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 21:14:05,051 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 21:14:05,051 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 21:14:05,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 21:14:05,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 21:14:05,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 21:14:05,052 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 21:14:05,052 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 21:14:05,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 21:14:05,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 21:14:05,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 21:14:05,053 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 21:14:05,053 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 21:14:05,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 21:14:05,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:14:05,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 21:14:05,054 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 21:14:05,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 21:14:05,054 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 21:14:05,054 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 21:14:05,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:05,054 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 21:14:05,055 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 21:14:05,055 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 21:14:05,055 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 21:14:05,056 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 21:14:05,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 21:14:05,098 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 21:14:05,101 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 21:14:05,103 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 21:14:05,103 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 21:14:05,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-06 21:14:05,443 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf19564fbf [2018-04-06 21:14:05,560 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 21:14:05,560 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 21:14:05,561 INFO L168 CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-06 21:14:05,562 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 21:14:05,562 INFO L215 ultiparseSymbolTable]: [2018-04-06 21:14:05,562 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 21:14:05,562 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-06 21:14:05,562 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-06 21:14:05,563 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-06 21:14:05,563 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 21:14:05,563 INFO L233 ultiparseSymbolTable]: [2018-04-06 21:14:05,578 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf19564fbf [2018-04-06 21:14:05,582 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 21:14:05,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 21:14:05,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 21:14:05,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 21:14:05,590 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 21:14:05,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd0dd6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05, skipping insertion in model container [2018-04-06 21:14:05,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,607 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:14:05,619 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:14:05,747 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:14:05,773 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:14:05,778 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10. [2018-04-06 21:14:05,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05 WrapperNode [2018-04-06 21:14:05,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 21:14:05,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 21:14:05,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 21:14:05,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 21:14:05,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... [2018-04-06 21:14:05,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 21:14:05,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 21:14:05,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 21:14:05,825 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 21:14:05,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:14:05,887 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 21:14:05,888 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 21:14:05,888 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-06 21:14:05,888 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-06 21:14:05,888 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 21:14:05,888 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar [2018-04-06 21:14:05,889 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 21:14:05,889 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-04-06 21:14:05,889 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 21:14:05,889 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 21:14:05,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 21:14:05,889 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 21:14:05,889 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 21:14:05,890 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 21:14:05,890 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 21:14:06,233 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 21:14:06,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:14:06 BoogieIcfgContainer [2018-04-06 21:14:06,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 21:14:06,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 21:14:06,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 21:14:06,239 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 21:14:06,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:14:05" (1/3) ... [2018-04-06 21:14:06,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2ef347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:14:06, skipping insertion in model container [2018-04-06 21:14:06,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:05" (2/3) ... [2018-04-06 21:14:06,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e2ef347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:14:06, skipping insertion in model container [2018-04-06 21:14:06,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:14:06" (3/3) ... [2018-04-06 21:14:06,244 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-04-06 21:14:06,253 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 21:14:06,260 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-06 21:14:06,303 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 21:14:06,304 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 21:14:06,304 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 21:14:06,304 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 21:14:06,304 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 21:14:06,304 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 21:14:06,304 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 21:14:06,304 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 21:14:06,305 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 21:14:06,306 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 21:14:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-04-06 21:14:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-06 21:14:06,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:06,326 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:06,326 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1517835154, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:06,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:06,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:06,396 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:06,462 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:06,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 21:14:06,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-06 21:14:06,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-06 21:14:06,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-06 21:14:06,477 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2018-04-06 21:14:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:06,503 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-04-06 21:14:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-06 21:14:06,504 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-04-06 21:14:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:06,511 INFO L225 Difference]: With dead ends: 169 [2018-04-06 21:14:06,512 INFO L226 Difference]: Without dead ends: 86 [2018-04-06 21:14:06,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-06 21:14:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-06 21:14:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-06 21:14:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-06 21:14:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-06 21:14:06,556 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 14 [2018-04-06 21:14:06,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:06,556 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-06 21:14:06,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-06 21:14:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-06 21:14:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-06 21:14:06,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:06,558 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:06,558 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash -693346302, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:06,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:06,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:06,633 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:06,678 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:06,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-06 21:14:06,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 21:14:06,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 21:14:06,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:14:06,681 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 4 states. [2018-04-06 21:14:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:06,733 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-04-06 21:14:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 21:14:06,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-06 21:14:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:06,737 INFO L225 Difference]: With dead ends: 110 [2018-04-06 21:14:06,738 INFO L226 Difference]: Without dead ends: 93 [2018-04-06 21:14:06,739 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:14:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-06 21:14:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-04-06 21:14:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-06 21:14:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-04-06 21:14:06,754 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 15 [2018-04-06 21:14:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:06,754 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-04-06 21:14:06,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 21:14:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-04-06 21:14:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-06 21:14:06,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:06,755 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:06,755 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1457275385, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:06,763 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:06,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:06,847 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:06,921 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:06,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2018-04-06 21:14:06,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 21:14:06,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 21:14:06,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-06 21:14:06,923 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 7 states. [2018-04-06 21:14:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:07,059 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-04-06 21:14:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 21:14:07,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-06 21:14:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:07,062 INFO L225 Difference]: With dead ends: 188 [2018-04-06 21:14:07,062 INFO L226 Difference]: Without dead ends: 114 [2018-04-06 21:14:07,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-06 21:14:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-06 21:14:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2018-04-06 21:14:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-06 21:14:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-04-06 21:14:07,077 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21 [2018-04-06 21:14:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:07,077 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-04-06 21:14:07,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 21:14:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-04-06 21:14:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-06 21:14:07,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:07,079 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] [2018-04-06 21:14:07,079 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 80098363, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:07,087 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:07,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:07,240 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:07,339 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:07,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2018-04-06 21:14:07,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 21:14:07,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 21:14:07,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-06 21:14:07,341 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 9 states. [2018-04-06 21:14:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:07,526 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-04-06 21:14:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 21:14:07,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-06 21:14:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:07,529 INFO L225 Difference]: With dead ends: 210 [2018-04-06 21:14:07,529 INFO L226 Difference]: Without dead ends: 124 [2018-04-06 21:14:07,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-06 21:14:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-06 21:14:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2018-04-06 21:14:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-06 21:14:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-04-06 21:14:07,541 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 29 [2018-04-06 21:14:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:07,542 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-04-06 21:14:07,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 21:14:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-04-06 21:14:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-06 21:14:07,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:07,543 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, 1, 1, 1, 1] [2018-04-06 21:14:07,543 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:07,544 INFO L82 PathProgramCache]: Analyzing trace with hash -666706721, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:07,554 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:07,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:07,596 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:07,710 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:07,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 21:14:07,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 21:14:07,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 21:14:07,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:14:07,712 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 5 states. [2018-04-06 21:14:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:07,752 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-04-06 21:14:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:14:07,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-06 21:14:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:07,757 INFO L225 Difference]: With dead ends: 204 [2018-04-06 21:14:07,757 INFO L226 Difference]: Without dead ends: 124 [2018-04-06 21:14:07,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:14:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-06 21:14:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-04-06 21:14:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-06 21:14:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-04-06 21:14:07,780 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 41 [2018-04-06 21:14:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:07,781 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-04-06 21:14:07,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 21:14:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-04-06 21:14:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-06 21:14:07,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:07,782 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, 1, 1, 1, 1] [2018-04-06 21:14:07,783 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash -699612892, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:07,792 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:07,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:07,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:14:07,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:07,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:07,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:14:07,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:07,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-06 21:14:07,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:07,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:14:07,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-06 21:14:07,931 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)))) is different from true [2018-04-06 21:14:07,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:07,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:07,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-04-06 21:14:07,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:07,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 21:14:07,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-06 21:14:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:07,966 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:08,199 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:08,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 21:14:08,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 21:14:08,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 21:14:08,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132 [2018-04-06 21:14:08,201 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 12 states. [2018-04-06 21:14:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:09,036 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-04-06 21:14:09,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 21:14:09,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-06 21:14:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:09,039 INFO L225 Difference]: With dead ends: 122 [2018-04-06 21:14:09,039 INFO L226 Difference]: Without dead ends: 119 [2018-04-06 21:14:09,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=4, NotChecked=34, Total=380 [2018-04-06 21:14:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-06 21:14:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-04-06 21:14:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-06 21:14:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-04-06 21:14:09,052 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 41 [2018-04-06 21:14:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:09,053 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-04-06 21:14:09,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 21:14:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-04-06 21:14:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-06 21:14:09,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:09,054 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, 1, 1, 1, 1] [2018-04-06 21:14:09,055 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:09,055 INFO L82 PathProgramCache]: Analyzing trace with hash -699612891, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:09,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:09,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:09,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:14:09,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:09,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:14:09,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:09,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:09,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 21:14:09,231 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-06 21:14:09,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:14:09,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:09,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-06 21:14:09,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:09,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 21:14:09,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-06 21:14:09,294 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (store |c_old(#length)| v_prenex_1 (* 4 v_prenex_2)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_1)))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true [2018-04-06 21:14:09,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:09,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:09,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 21:14:09,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:09,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 21:14:09,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:09,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-06 21:14:09,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:33 [2018-04-06 21:14:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:09,406 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:09,515 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-04-06 21:14:17,683 WARN L151 SmtUtils]: Spent 8101ms on a formula simplification. DAG size of input: 71 DAG size of output 31 [2018-04-06 21:14:17,749 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-06 21:14:24,558 WARN L148 SmtUtils]: Spent 6057ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-06 21:14:28,755 WARN L148 SmtUtils]: Spent 4063ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-06 21:14:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:28,812 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:28,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 15 [2018-04-06 21:14:28,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 21:14:28,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 21:14:28,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=142, Unknown=2, NotChecked=50, Total=240 [2018-04-06 21:14:28,814 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 16 states. [2018-04-06 21:14:29,675 WARN L151 SmtUtils]: Spent 701ms on a formula simplification. DAG size of input: 52 DAG size of output 48 [2018-04-06 21:14:30,342 WARN L151 SmtUtils]: Spent 619ms on a formula simplification. DAG size of input: 56 DAG size of output 52 [2018-04-06 21:14:33,179 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-06 21:14:42,556 WARN L151 SmtUtils]: Spent 942ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-04-06 21:14:49,145 WARN L148 SmtUtils]: Spent 2093ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-06 21:14:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:49,630 INFO L93 Difference]: Finished difference Result 214 states and 232 transitions. [2018-04-06 21:14:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-06 21:14:49,631 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-06 21:14:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:49,633 INFO L225 Difference]: With dead ends: 214 [2018-04-06 21:14:49,633 INFO L226 Difference]: Without dead ends: 212 [2018-04-06 21:14:49,633 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=136, Invalid=463, Unknown=9, NotChecked=94, Total=702 [2018-04-06 21:14:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-06 21:14:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 129. [2018-04-06 21:14:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-06 21:14:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-04-06 21:14:49,646 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 41 [2018-04-06 21:14:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:49,647 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-04-06 21:14:49,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 21:14:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-04-06 21:14:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-06 21:14:49,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:49,648 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:49,648 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 21:14:49,648 INFO L82 PathProgramCache]: Analyzing trace with hash 521847270, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:49,658 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:49,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:49,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:14:49,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:49,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 21:14:49,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:49,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:49,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 21:14:49,724 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true [2018-04-06 21:14:49,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 21:14:49,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:49,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-06 21:14:49,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:49,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 21:14:49,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-04-06 21:14:49,815 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_16 Int) (v_prenex_17 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_16)) (= (store |c_old(#length)| v_prenex_16 (* 4 v_prenex_17)) |c_#length|)))) is different from true [2018-04-06 21:14:49,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:49,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 21:14:49,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:49,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:49,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:49,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 21:14:49,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:49,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-06 21:14:49,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-04-06 21:14:50,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:50,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-04-06 21:14:50,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-06 21:14:50,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:50,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:14:50,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 21:14:50,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:50,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-06 21:14:50,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52 [2018-04-06 21:14:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-04-06 21:14:50,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:50,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:14:50,586 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:14:50,605 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 16 treesize of output 7 [2018-04-06 21:14:50,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:50,616 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:14:50,616 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 21:14:50,617 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 25 treesize of output 16 [2018-04-06 21:14:50,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:50,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 21:14:50,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:20 [2018-04-06 21:14:53,070 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-04-06 21:14:53,088 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-04-06 21:15:07,875 WARN L151 SmtUtils]: Spent 9346ms on a formula simplification. DAG size of input: 99 DAG size of output 41 [2018-04-06 21:15:14,774 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 39 DAG size of output 34 [2018-04-06 21:15:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:19,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:19,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-06 21:15:19,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-06 21:15:19,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-06 21:15:19,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=8, NotChecked=78, Total=506 [2018-04-06 21:15:19,303 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 23 states. [2018-04-06 21:15:48,317 WARN L151 SmtUtils]: Spent 12073ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-06 21:16:08,203 WARN L148 SmtUtils]: Spent 6597ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-06 21:16:36,637 WARN L148 SmtUtils]: Spent 18146ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-06 21:16:45,356 WARN L151 SmtUtils]: Spent 1126ms on a formula simplification. DAG size of input: 48 DAG size of output 21 [2018-04-06 21:16:47,370 WARN L1011 $PredicateComparison]: unable to prove that (and (<= (+ c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 4) (select |c_#length| c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (<= 0 c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset) (exists ((v_prenex_38 Int)) (= (select |c_old(#valid)| v_prenex_38) 0)) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (< |v_main_~#b~0.offset_BEFORE_CALL_5| 0) (<= (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4) (select (store |c_#length| v_prenex_23 (* 4 v_prenex_24)) |v_main_~#b~0.base_BEFORE_CALL_7|)) (= v_prenex_23 |v_main_~#b~0.base_BEFORE_CALL_7|) (exists ((v_prenex_22 Int) (v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (< (select (store (store |c_old(#length)| v_prenex_22 (* 4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19)) |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)) |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)) (not (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= (select |c_old(#valid)| v_prenex_22) 0))))) (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (< |v_main_~#b~0.offset_BEFORE_CALL_5| 0) (forall ((v_prenex_23 Int) (v_prenex_24 Int)) (or (<= (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4) (select (store |c_#length| v_prenex_23 (* 4 v_prenex_24)) |v_main_~#b~0.base_BEFORE_CALL_7|)) (= v_prenex_23 |v_main_~#b~0.base_BEFORE_CALL_7|))) (exists ((v_prenex_22 Int) (v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (< (select (store (store |c_old(#length)| v_prenex_22 (* 4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19)) |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)) |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)) (not (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= (select |c_old(#valid)| v_prenex_22) 0)))))) is different from false [2018-04-06 21:16:55,092 WARN L151 SmtUtils]: Spent 484ms on a formula simplification. DAG size of input: 51 DAG size of output 24 [2018-04-06 21:17:13,514 WARN L151 SmtUtils]: Spent 8248ms on a formula simplification. DAG size of input: 62 DAG size of output 24 [2018-04-06 21:17:22,457 WARN L148 SmtUtils]: Spent 2037ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-06 21:18:10,015 WARN L151 SmtUtils]: Spent 560ms on a formula simplification. DAG size of input: 57 DAG size of output 24 [2018-04-06 21:18:12,020 WARN L1011 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~1))) (and (exists ((v_prenex_38 Int)) (= (select |c_old(#valid)| v_prenex_38) 0)) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_16 Int) (v_prenex_17 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_16)) (= (store |c_old(#length)| v_prenex_16 (* 4 v_prenex_17)) |c_#length|))) (<= (+ c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset .cse0 4) (select |c_#length| c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base)) (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (< |v_main_~#b~0.offset_BEFORE_CALL_5| 0) (<= (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4) (select (store |c_#length| v_prenex_23 (* 4 v_prenex_24)) |v_main_~#b~0.base_BEFORE_CALL_7|)) (= v_prenex_23 |v_main_~#b~0.base_BEFORE_CALL_7|) (exists ((v_prenex_22 Int) (v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (< (select (store (store |c_old(#length)| v_prenex_22 (* 4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19)) |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)) |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)) (not (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= (select |c_old(#valid)| v_prenex_22) 0))))) (<= 0 (+ c___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset .cse0)) (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (< |v_main_~#b~0.offset_BEFORE_CALL_5| 0) (forall ((v_prenex_23 Int) (v_prenex_24 Int)) (or (<= (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4) (select (store |c_#length| v_prenex_23 (* 4 v_prenex_24)) |v_main_~#b~0.base_BEFORE_CALL_7|)) (= v_prenex_23 |v_main_~#b~0.base_BEFORE_CALL_7|))) (exists ((v_prenex_22 Int) (v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (< (select (store (store |c_old(#length)| v_prenex_22 (* 4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19)) |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)) |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)) (not (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= (select |c_old(#valid)| v_prenex_22) 0))))))) is different from false [2018-04-06 21:18:20,535 WARN L151 SmtUtils]: Spent 2910ms on a formula simplification. DAG size of input: 48 DAG size of output 14 [2018-04-06 21:18:22,539 WARN L1011 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_38 Int)) (= (select |c_old(#valid)| v_prenex_38) 0)) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_16 Int) (v_prenex_17 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_16)) (= (store |c_old(#length)| v_prenex_16 (* 4 v_prenex_17)) |c_#length|))) (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_23 Int) (v_prenex_24 Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (< |v_main_~#b~0.offset_BEFORE_CALL_5| 0) (<= (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4) (select (store |c_#length| v_prenex_23 (* 4 v_prenex_24)) |v_main_~#b~0.base_BEFORE_CALL_7|)) (= v_prenex_23 |v_main_~#b~0.base_BEFORE_CALL_7|) (exists ((v_prenex_22 Int) (v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (< (select (store (store |c_old(#length)| v_prenex_22 (* 4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19)) |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)) |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)) (not (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= (select |c_old(#valid)| v_prenex_22) 0))))) (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (< |v_main_~#b~0.offset_BEFORE_CALL_5| 0) (forall ((v_prenex_23 Int) (v_prenex_24 Int)) (or (<= (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4) (select (store |c_#length| v_prenex_23 (* 4 v_prenex_24)) |v_main_~#b~0.base_BEFORE_CALL_7|)) (= v_prenex_23 |v_main_~#b~0.base_BEFORE_CALL_7|))) (exists ((v_prenex_22 Int) (v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19 Int) (|v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (< (select (store (store |c_old(#length)| v_prenex_22 (* 4 v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n_19)) |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)) |v_main_~#b~0.base_BEFORE_CALL_7|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)) (not (= |v___U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base_34| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= (select |c_old(#valid)| v_prenex_22) 0)))))) is different from false [2018-04-06 21:18:30,266 WARN L148 SmtUtils]: Spent 2030ms on a formula simplification that was a NOOP. DAG size: 63 [2018-04-06 21:18:46,603 WARN L151 SmtUtils]: Spent 4208ms on a formula simplification. DAG size of input: 74 DAG size of output 70 Received shutdown request... [2018-04-06 21:18:53,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-06 21:18:53,452 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 21:18:53,455 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 21:18:53,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:18:53 BoogieIcfgContainer [2018-04-06 21:18:53,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 21:18:53,456 INFO L168 Benchmark]: Toolchain (without parser) took 287873.66 ms. Allocated memory was 306.7 MB in the beginning and 542.6 MB in the end (delta: 235.9 MB). Free memory was 249.6 MB in the beginning and 328.9 MB in the end (delta: -79.3 MB). Peak memory consumption was 156.7 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:53,457 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.7 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 21:18:53,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.47 ms. Allocated memory is still 306.7 MB. Free memory was 249.6 MB in the beginning and 239.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:53,458 INFO L168 Benchmark]: Boogie Preprocessor took 34.14 ms. Allocated memory is still 306.7 MB. Free memory was 239.5 MB in the beginning and 237.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:53,459 INFO L168 Benchmark]: RCFGBuilder took 410.26 ms. Allocated memory was 306.7 MB in the beginning and 469.2 MB in the end (delta: 162.5 MB). Free memory was 237.5 MB in the beginning and 430.9 MB in the end (delta: -193.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:53,459 INFO L168 Benchmark]: TraceAbstraction took 287219.98 ms. Allocated memory was 469.2 MB in the beginning and 542.6 MB in the end (delta: 73.4 MB). Free memory was 430.9 MB in the beginning and 328.9 MB in the end (delta: 102.0 MB). Peak memory consumption was 175.4 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:53,461 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 306.7 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.47 ms. Allocated memory is still 306.7 MB. Free memory was 249.6 MB in the beginning and 239.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.14 ms. Allocated memory is still 306.7 MB. Free memory was 239.5 MB in the beginning and 237.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 410.26 ms. Allocated memory was 306.7 MB in the beginning and 469.2 MB in the end (delta: 162.5 MB). Free memory was 237.5 MB in the beginning and 430.9 MB in the end (delta: -193.4 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 287219.98 ms. Allocated memory was 469.2 MB in the beginning and 542.6 MB in the end (delta: 73.4 MB). Free memory was 430.9 MB in the beginning and 328.9 MB in the end (delta: 102.0 MB). Peak memory consumption was 175.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and interpolant automaton (currently 19 states, 23 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 89 locations, 11 error locations. TIMEOUT Result, 287.1s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 236.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 582 SDtfs, 754 SDslu, 1755 SDs, 0 SdLazy, 1013 SolverSat, 127 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 81.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 553 GetRequests, 441 SyntacticMatches, 10 SemanticMatches, 101 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 202.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 111 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 50.1s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 502 ConstructedInterpolants, 157 QuantifiedInterpolants, 242626 SizeOfPredicates, 29 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 6/22 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/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_21-18-53-469.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_21-18-53-469.csv Completed graceful shutdown