./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:33:18,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:33:18,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:33:18,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:33:18,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:33:18,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:33:18,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:33:18,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:33:18,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:33:18,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:33:18,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:33:18,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:33:18,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:33:18,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:33:18,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:33:18,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:33:18,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:33:18,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:33:18,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:33:18,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:33:18,477 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:33:18,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:33:18,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:33:18,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:33:18,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:33:18,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:33:18,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:33:18,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:33:18,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:33:18,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:33:18,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:33:18,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:33:18,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:33:18,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:33:18,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:33:18,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:33:18,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:33:18,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:33:18,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:33:18,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:33:18,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:33:18,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:33:18,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:33:18,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:33:18,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:33:18,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:33:18,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:33:18,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:33:18,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:33:18,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:33:18,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:33:18,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:33:18,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:33:18,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:33:18,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:33:18,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:33:18,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:33:18,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:33:18,529 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:33:18,529 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:33:18,530 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:33:18,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:33:18,530 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:33:18,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:33:18,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:33:18,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:33:18,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:33:18,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:33:18,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:18,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:33:18,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:33:18,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:33:18,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:33:18,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2022-07-12 18:33:18,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:33:18,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:33:18,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:33:18,706 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:33:18,707 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:33:18,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2022-07-12 18:33:18,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7e639d6/35bc40e16c2542d388511681475e5145/FLAG854d3117f [2022-07-12 18:33:19,193 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:33:19,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2022-07-12 18:33:19,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7e639d6/35bc40e16c2542d388511681475e5145/FLAG854d3117f [2022-07-12 18:33:19,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7e639d6/35bc40e16c2542d388511681475e5145 [2022-07-12 18:33:19,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:33:19,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:33:19,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:19,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:33:19,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:33:19,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2582b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19, skipping insertion in model container [2022-07-12 18:33:19,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:33:19,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:33:19,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:19,748 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:33:19,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:19,800 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:33:19,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19 WrapperNode [2022-07-12 18:33:19,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:19,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:19,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:33:19,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:33:19,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,828 INFO L137 Inliner]: procedures = 125, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2022-07-12 18:33:19,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:19,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:33:19,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:33:19,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:33:19,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:33:19,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:33:19,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:33:19,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:33:19,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (1/1) ... [2022-07-12 18:33:19,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:19,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:19,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:33:19,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:33:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:33:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:33:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:33:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:33:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:33:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:33:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:33:19,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:33:19,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:33:19,987 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:33:19,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:33:20,188 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:33:20,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:33:20,193 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 18:33:20,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:20 BoogieIcfgContainer [2022-07-12 18:33:20,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:33:20,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:33:20,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:33:20,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:33:20,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:33:19" (1/3) ... [2022-07-12 18:33:20,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f380638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:20, skipping insertion in model container [2022-07-12 18:33:20,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:19" (2/3) ... [2022-07-12 18:33:20,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f380638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:20, skipping insertion in model container [2022-07-12 18:33:20,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:20" (3/3) ... [2022-07-12 18:33:20,216 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2022-07-12 18:33:20,226 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:33:20,226 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-07-12 18:33:20,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:33:20,302 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15f8cad9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34967d77 [2022-07-12 18:33:20,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-07-12 18:33:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:33:20,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:20,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:33:20,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:20,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:33:20,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:20,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292780302] [2022-07-12 18:33:20,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:20,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:20,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292780302] [2022-07-12 18:33:20,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292780302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:20,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:20,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324133099] [2022-07-12 18:33:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:20,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:20,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:20,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:20,564 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:20,642 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-07-12 18:33:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:33:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:20,649 INFO L225 Difference]: With dead ends: 48 [2022-07-12 18:33:20,650 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 18:33:20,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:20,655 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:20,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 18:33:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-07-12 18:33:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-07-12 18:33:20,682 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2022-07-12 18:33:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:20,682 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-07-12 18:33:20,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-07-12 18:33:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:33:20,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:20,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:33:20,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:33:20,684 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:33:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:20,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485272142] [2022-07-12 18:33:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485272142] [2022-07-12 18:33:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485272142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:20,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785377638] [2022-07-12 18:33:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:20,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:20,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:20,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:20,762 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:20,788 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-07-12 18:33:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:20,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:33:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:20,789 INFO L225 Difference]: With dead ends: 38 [2022-07-12 18:33:20,789 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 18:33:20,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:20,794 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:20,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 18:33:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-12 18:33:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-07-12 18:33:20,802 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2022-07-12 18:33:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:20,802 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-07-12 18:33:20,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-07-12 18:33:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:33:20,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:20,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:33:20,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:33:20,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-07-12 18:33:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:20,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391603430] [2022-07-12 18:33:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:20,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:20,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391603430] [2022-07-12 18:33:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391603430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886850408] [2022-07-12 18:33:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:20,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:20,880 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:20,934 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-07-12 18:33:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:33:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 18:33:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:20,937 INFO L225 Difference]: With dead ends: 44 [2022-07-12 18:33:20,938 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 18:33:20,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:20,939 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:20,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 18:33:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-07-12 18:33:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-07-12 18:33:20,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2022-07-12 18:33:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:20,945 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-07-12 18:33:20,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-07-12 18:33:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:20,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:20,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:20,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:33:20,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:20,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:20,946 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-07-12 18:33:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:20,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034090014] [2022-07-12 18:33:20,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:20,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:21,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:21,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034090014] [2022-07-12 18:33:21,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034090014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:21,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:21,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:33:21,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238153286] [2022-07-12 18:33:21,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:21,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:33:21,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:21,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:33:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:33:21,006 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:21,069 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-07-12 18:33:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:33:21,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:33:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:21,070 INFO L225 Difference]: With dead ends: 39 [2022-07-12 18:33:21,070 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 18:33:21,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:21,071 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:21,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 18:33:21,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-12 18:33:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-12 18:33:21,075 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2022-07-12 18:33:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:21,075 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-12 18:33:21,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-12 18:33:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:21,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:21,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:21,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:33:21,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-07-12 18:33:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:21,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90221617] [2022-07-12 18:33:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:21,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:21,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90221617] [2022-07-12 18:33:21,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90221617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:21,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:21,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:33:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685625089] [2022-07-12 18:33:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:21,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:33:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:21,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:33:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:33:21,158 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:21,207 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-07-12 18:33:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:33:21,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:33:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:21,208 INFO L225 Difference]: With dead ends: 31 [2022-07-12 18:33:21,208 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 18:33:21,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:21,209 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:21,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 18:33:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 18:33:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-12 18:33:21,212 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2022-07-12 18:33:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:21,212 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-12 18:33:21,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-12 18:33:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:33:21,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:21,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:21,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:33:21,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:21,214 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2022-07-12 18:33:21,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:21,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509665934] [2022-07-12 18:33:21,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:21,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:21,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:21,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509665934] [2022-07-12 18:33:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509665934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:21,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:21,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:33:21,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963810582] [2022-07-12 18:33:21,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:33:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:21,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:33:21,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:21,297 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:21,372 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-07-12 18:33:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:21,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 18:33:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:21,373 INFO L225 Difference]: With dead ends: 30 [2022-07-12 18:33:21,373 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:33:21,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:33:21,374 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:21,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 56 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:33:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 18:33:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-07-12 18:33:21,376 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2022-07-12 18:33:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:21,377 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-07-12 18:33:21,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-07-12 18:33:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:33:21,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:21,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:21,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:33:21,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2022-07-12 18:33:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446877548] [2022-07-12 18:33:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446877548] [2022-07-12 18:33:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446877548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:21,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:21,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:33:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728037771] [2022-07-12 18:33:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:21,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:33:21,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:33:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:21,479 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:21,569 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-07-12 18:33:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:21,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:33:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:21,578 INFO L225 Difference]: With dead ends: 29 [2022-07-12 18:33:21,579 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 18:33:21,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:33:21,580 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:21,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 37 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 18:33:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-12 18:33:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-07-12 18:33:21,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 14 [2022-07-12 18:33:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:21,592 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-07-12 18:33:21,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-07-12 18:33:21,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:33:21,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:21,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:21,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:33:21,594 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2022-07-12 18:33:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:21,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612173303] [2022-07-12 18:33:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:21,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:33:21,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612173303] [2022-07-12 18:33:21,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612173303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:21,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:21,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:33:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421029956] [2022-07-12 18:33:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:21,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:33:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:33:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:33:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:21,700 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:21,790 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-07-12 18:33:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:33:21,791 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:33:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:21,791 INFO L225 Difference]: With dead ends: 30 [2022-07-12 18:33:21,791 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:33:21,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:33:21,792 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:21,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 45 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:33:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-12 18:33:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-07-12 18:33:21,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2022-07-12 18:33:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:21,795 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-07-12 18:33:21,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-07-12 18:33:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:33:21,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:21,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:21,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:33:21,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2022-07-12 18:33:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:33:21,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170109807] [2022-07-12 18:33:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:33:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:21,832 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:33:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:21,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 18:33:21,865 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:33:21,866 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2022-07-12 18:33:21,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2022-07-12 18:33:21,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2022-07-12 18:33:21,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2022-07-12 18:33:21,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2022-07-12 18:33:21,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2022-07-12 18:33:21,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2022-07-12 18:33:21,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2022-07-12 18:33:21,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2022-07-12 18:33:21,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2022-07-12 18:33:21,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2022-07-12 18:33:21,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:33:21,871 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:21,879 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:33:21,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:33:21 BoogieIcfgContainer [2022-07-12 18:33:21,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:33:21,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:33:21,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:33:21,897 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:33:21,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:20" (3/4) ... [2022-07-12 18:33:21,899 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:33:21,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:33:21,900 INFO L158 Benchmark]: Toolchain (without parser) took 2353.43ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 83.3MB in the beginning and 76.6MB in the end (delta: 6.7MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-07-12 18:33:21,900 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 60.7MB in the beginning and 60.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:21,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.84ms. Allocated memory is still 107.0MB. Free memory was 83.1MB in the beginning and 67.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 18:33:21,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.94ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 65.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:21,901 INFO L158 Benchmark]: Boogie Preprocessor took 29.05ms. Allocated memory is still 107.0MB. Free memory was 65.4MB in the beginning and 64.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:21,901 INFO L158 Benchmark]: RCFGBuilder took 334.59ms. Allocated memory is still 107.0MB. Free memory was 64.1MB in the beginning and 78.6MB in the end (delta: -14.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-07-12 18:33:21,901 INFO L158 Benchmark]: TraceAbstraction took 1701.37ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 78.2MB in the beginning and 77.2MB in the end (delta: 979.4kB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-07-12 18:33:21,901 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 130.0MB. Free memory was 77.2MB in the beginning and 76.6MB in the end (delta: 606.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:21,902 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 60.7MB in the beginning and 60.6MB in the end (delta: 40.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.84ms. Allocated memory is still 107.0MB. Free memory was 83.1MB in the beginning and 67.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.94ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 65.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.05ms. Allocated memory is still 107.0MB. Free memory was 65.4MB in the beginning and 64.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 334.59ms. Allocated memory is still 107.0MB. Free memory was 64.1MB in the beginning and 78.6MB in the end (delta: -14.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1701.37ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 78.2MB in the beginning and 77.2MB in the end (delta: 979.4kB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 130.0MB. Free memory was 77.2MB in the beginning and 76.6MB in the end (delta: 606.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={3:0}, pdata={3:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={-2:0}, pdata={3:0}, pdata={3:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={3:0}, data={3:0}, data->lo={-1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={3:0}, data={3:0}, data->hi={-2:0}, lo={-1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L540] data->lo = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L541] data->hi = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 347 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 160 mSDtfsCounter, 347 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 18:33:21,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:33:23,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:33:23,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:33:23,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:33:23,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:33:23,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:33:23,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:33:23,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:33:23,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:33:23,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:33:23,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:33:23,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:33:23,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:33:23,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:33:23,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:33:23,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:33:23,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:33:23,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:33:23,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:33:23,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:33:23,665 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:33:23,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:33:23,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:33:23,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:33:23,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:33:23,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:33:23,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:33:23,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:33:23,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:33:23,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:33:23,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:33:23,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:33:23,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:33:23,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:33:23,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:33:23,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:33:23,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:33:23,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:33:23,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:33:23,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:33:23,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:33:23,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:33:23,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:33:23,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:33:23,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:33:23,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:33:23,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:33:23,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:33:23,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:33:23,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:33:23,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:33:23,710 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:33:23,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:33:23,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:33:23,711 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:33:23,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:33:23,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:33:23,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:33:23,712 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:33:23,712 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:33:23,712 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:33:23,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:33:23,712 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:33:23,713 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:33:23,713 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:33:23,713 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:33:23,713 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:33:23,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:33:23,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:33:23,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:33:23,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:23,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:33:23,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:33:23,714 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:33:23,714 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:33:23,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:33:23,715 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40afad058466dec508429aba14a695fa830becbd8e90e3307f02f796ff077dad [2022-07-12 18:33:23,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:33:24,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:33:24,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:33:24,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:33:24,016 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:33:24,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2022-07-12 18:33:24,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6612853/cee51e7162a145f38e1f3343f9080710/FLAGfbc4b932f [2022-07-12 18:33:24,478 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:33:24,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2022-07-12 18:33:24,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6612853/cee51e7162a145f38e1f3343f9080710/FLAGfbc4b932f [2022-07-12 18:33:24,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6612853/cee51e7162a145f38e1f3343f9080710 [2022-07-12 18:33:24,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:33:24,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:33:24,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:24,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:33:24,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:33:24,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dfe7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24, skipping insertion in model container [2022-07-12 18:33:24,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:33:24,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:33:24,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:24,819 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:33:24,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:33:24,878 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:33:24,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24 WrapperNode [2022-07-12 18:33:24,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:33:24,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:24,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:33:24,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:33:24,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,925 INFO L137 Inliner]: procedures = 126, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2022-07-12 18:33:24,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:33:24,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:33:24,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:33:24,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:33:24,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:33:24,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:33:24,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:33:24,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:33:24,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (1/1) ... [2022-07-12 18:33:24,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:33:24,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:33:24,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:33:25,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:33:25,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:33:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:33:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:33:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:33:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:33:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:33:25,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 18:33:25,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:33:25,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:33:25,123 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:33:25,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:33:25,372 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:33:25,377 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:33:25,377 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 18:33:25,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:25 BoogieIcfgContainer [2022-07-12 18:33:25,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:33:25,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:33:25,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:33:25,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:33:25,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:33:24" (1/3) ... [2022-07-12 18:33:25,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb35c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:25, skipping insertion in model container [2022-07-12 18:33:25,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:33:24" (2/3) ... [2022-07-12 18:33:25,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb35c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:33:25, skipping insertion in model container [2022-07-12 18:33:25,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:25" (3/3) ... [2022-07-12 18:33:25,386 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2022-07-12 18:33:25,395 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:33:25,395 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-07-12 18:33:25,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:33:25,432 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d7ba463, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bbdddbe [2022-07-12 18:33:25,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-07-12 18:33:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:33:25,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:25,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:33:25,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 18:33:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:25,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171539013] [2022-07-12 18:33:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:25,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:25,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:25,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:25,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:33:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:25,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:33:25,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:25,582 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:33:25,583 INFO L390 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-12 18:33:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:25,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:25,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:25,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171539013] [2022-07-12 18:33:25,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171539013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:25,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:25,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:25,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191771929] [2022-07-12 18:33:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:25,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:25,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:25,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:25,635 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:25,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:25,725 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-07-12 18:33:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:25,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:33:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:25,732 INFO L225 Difference]: With dead ends: 48 [2022-07-12 18:33:25,732 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 18:33:25,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:25,738 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:25,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 18:33:25,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-07-12 18:33:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-07-12 18:33:25,765 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2022-07-12 18:33:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:25,765 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-07-12 18:33:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-07-12 18:33:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 18:33:25,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:25,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 18:33:25,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:25,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:25,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:25,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 18:33:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:25,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337233394] [2022-07-12 18:33:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:25,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:25,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:25,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:25,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:33:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:26,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 18:33:26,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:26,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:33:26,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 11 [2022-07-12 18:33:26,064 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:33:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:26,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:26,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:26,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337233394] [2022-07-12 18:33:26,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337233394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:26,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:26,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:33:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207225495] [2022-07-12 18:33:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:26,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:33:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:33:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:26,086 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:26,136 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-07-12 18:33:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:33:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-12 18:33:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:26,138 INFO L225 Difference]: With dead ends: 38 [2022-07-12 18:33:26,138 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 18:33:26,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:33:26,139 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:26,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 18:33:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-12 18:33:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-07-12 18:33:26,142 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2022-07-12 18:33:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:26,143 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-07-12 18:33:26,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-07-12 18:33:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:33:26,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:26,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:33:26,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-12 18:33:26,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:26,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-07-12 18:33:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:26,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161605749] [2022-07-12 18:33:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:26,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:26,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:26,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:33:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:26,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:33:26,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:26,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:33:26,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 11 [2022-07-12 18:33:26,493 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:33:26,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:33:26,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 18:33:26,552 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:33:26,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:33:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:26,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:26,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:26,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161605749] [2022-07-12 18:33:26,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161605749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:26,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:26,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:33:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458326192] [2022-07-12 18:33:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:26,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:33:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:26,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:33:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:26,560 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:26,640 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-07-12 18:33:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:33:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-12 18:33:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:26,642 INFO L225 Difference]: With dead ends: 44 [2022-07-12 18:33:26,642 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 18:33:26,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:33:26,643 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 63 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:26,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 18:33:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-07-12 18:33:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-07-12 18:33:26,646 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2022-07-12 18:33:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:26,646 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-07-12 18:33:26,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-07-12 18:33:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:26,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:26,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:26,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:26,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:26,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-07-12 18:33:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:26,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21987937] [2022-07-12 18:33:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:26,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:26,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:26,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:26,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:33:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:26,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:33:26,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:26,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:26,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:26,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21987937] [2022-07-12 18:33:26,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21987937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:26,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:26,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:33:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867632949] [2022-07-12 18:33:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:33:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:26,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:33:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:33:26,933 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:27,041 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-07-12 18:33:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:33:27,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:33:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:27,042 INFO L225 Difference]: With dead ends: 39 [2022-07-12 18:33:27,042 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 18:33:27,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:33:27,043 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:27,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 31 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 18:33:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-12 18:33:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.565217391304348) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-12 18:33:27,047 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2022-07-12 18:33:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:27,047 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-12 18:33:27,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-12 18:33:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:33:27,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:27,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:27,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:27,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:27,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-07-12 18:33:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:27,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619508442] [2022-07-12 18:33:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:27,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:27,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:27,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:27,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:33:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:27,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 18:33:27,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:27,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:27,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619508442] [2022-07-12 18:33:27,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619508442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:27,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:27,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:33:27,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897872363] [2022-07-12 18:33:27,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:27,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:33:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:33:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:33:27,381 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:27,460 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-07-12 18:33:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:33:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:33:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:27,461 INFO L225 Difference]: With dead ends: 31 [2022-07-12 18:33:27,461 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 18:33:27,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:33:27,462 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:27,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:33:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 18:33:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 18:33:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-12 18:33:27,464 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2022-07-12 18:33:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:27,464 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-12 18:33:27,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:27,464 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-12 18:33:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:33:27,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:27,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:27,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:27,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:27,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2022-07-12 18:33:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:27,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986064600] [2022-07-12 18:33:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:27,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:27,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:27,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:33:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:27,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:33:27,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:27,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-07-12 18:33:27,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:33:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:27,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:27,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:27,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986064600] [2022-07-12 18:33:27,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986064600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:27,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:27,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:33:27,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431257131] [2022-07-12 18:33:27,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:27,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:33:27,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:27,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:33:27,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:33:27,856 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:28,129 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-07-12 18:33:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:33:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 18:33:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:28,130 INFO L225 Difference]: With dead ends: 33 [2022-07-12 18:33:28,130 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 18:33:28,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:33:28,131 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:28,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 63 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:33:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 18:33:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-12 18:33:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-07-12 18:33:28,133 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2022-07-12 18:33:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:28,135 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-07-12 18:33:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-07-12 18:33:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:33:28,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:28,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:28,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:28,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:28,343 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2022-07-12 18:33:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:28,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559473318] [2022-07-12 18:33:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:28,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:28,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:28,346 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:28,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:33:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:28,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:33:28,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:28,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-07-12 18:33:28,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 18:33:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:28,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:28,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:28,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559473318] [2022-07-12 18:33:28,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559473318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:28,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:28,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:33:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844855579] [2022-07-12 18:33:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:28,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:33:28,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:28,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:33:28,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:33:28,699 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:28,705 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2022-07-12 18:33:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:33:28,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:33:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:28,706 INFO L225 Difference]: With dead ends: 32 [2022-07-12 18:33:28,706 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 18:33:28,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:33:28,707 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:28,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 47 Unchecked, 0.0s Time] [2022-07-12 18:33:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 18:33:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-07-12 18:33:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-07-12 18:33:28,710 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 14 [2022-07-12 18:33:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:28,711 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-07-12 18:33:28,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-07-12 18:33:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:33:28,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:28,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:28,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:28,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:28,920 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2022-07-12 18:33:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:28,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990410697] [2022-07-12 18:33:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:28,922 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:28,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:33:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:33:28,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:33:28,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:33:29,001 INFO L390 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 [2022-07-12 18:33:29,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-07-12 18:33:29,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 18:33:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:33:29,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:33:29,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:33:29,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990410697] [2022-07-12 18:33:29,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990410697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:33:29,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:33:29,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:33:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228351727] [2022-07-12 18:33:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:33:29,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:33:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:33:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:33:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:33:29,088 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:33:29,404 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-07-12 18:33:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:33:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:33:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:33:29,405 INFO L225 Difference]: With dead ends: 29 [2022-07-12 18:33:29,405 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 18:33:29,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:33:29,406 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:33:29,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 40 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:33:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 18:33:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-12 18:33:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-07-12 18:33:29,408 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 15 [2022-07-12 18:33:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:33:29,408 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-07-12 18:33:29,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:33:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-07-12 18:33:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:33:29,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:33:29,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:29,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:33:29,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:29,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2022-07-12 18:33:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:33:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2022-07-12 18:33:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:33:29,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328257251] [2022-07-12 18:33:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:33:29,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:33:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:33:29,611 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:33:29,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:33:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:29,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:33:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:33:29,748 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 18:33:29,748 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:33:29,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2022-07-12 18:33:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2022-07-12 18:33:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2022-07-12 18:33:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2022-07-12 18:33:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2022-07-12 18:33:29,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2022-07-12 18:33:29,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2022-07-12 18:33:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2022-07-12 18:33:29,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2022-07-12 18:33:29,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-12 18:33:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:33:29,954 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:33:29,956 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:33:29,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:33:29 BoogieIcfgContainer [2022-07-12 18:33:29,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:33:29,976 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:33:29,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:33:29,976 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:33:29,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:33:25" (3/4) ... [2022-07-12 18:33:29,978 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 18:33:29,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:33:29,979 INFO L158 Benchmark]: Toolchain (without parser) took 5473.12ms. Allocated memory was 52.4MB in the beginning and 83.9MB in the end (delta: 31.5MB). Free memory was 28.0MB in the beginning and 48.5MB in the end (delta: -20.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-07-12 18:33:29,979 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 52.4MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:29,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.74ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.8MB in the beginning and 45.5MB in the end (delta: -17.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-12 18:33:29,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.53ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 43.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:29,982 INFO L158 Benchmark]: Boogie Preprocessor took 25.75ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 42.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:33:29,982 INFO L158 Benchmark]: RCFGBuilder took 425.56ms. Allocated memory is still 69.2MB. Free memory was 42.0MB in the beginning and 45.9MB in the end (delta: -3.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-07-12 18:33:29,982 INFO L158 Benchmark]: TraceAbstraction took 4594.51ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.3MB in the beginning and 48.5MB in the end (delta: -3.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-07-12 18:33:29,983 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:33:29,987 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 52.4MB. Free memory was 34.6MB in the beginning and 34.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.74ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.8MB in the beginning and 45.5MB in the end (delta: -17.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.53ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 43.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.75ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 42.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.56ms. Allocated memory is still 69.2MB. Free memory was 42.0MB in the beginning and 45.9MB in the end (delta: -3.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4594.51ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.3MB in the beginning and 48.5MB in the end (delta: -3.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; [L545] CALL alloc_data(&data) [L529] pdata->lo = malloc(16) VAL [malloc(16)={3:0}, pdata={11:0}, pdata={11:0}] [L530] pdata->hi = malloc(24) VAL [malloc(24)={4:0}, pdata={11:0}, pdata={11:0}] [L545] RET alloc_data(&data) [L546] CALL free_data(&data) [L534] EXPR data->lo VAL [data={11:0}, data={11:0}, data->lo={3:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={11:0}, data={11:0}, data->hi={4:0}, lo={3:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L540] data->lo = (void *) 0 VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L541] data->hi = (void *) 0 VAL [data={11:0}, data={11:0}, hi={4:0}, lo={3:0}] [L546] RET free_data(&data) [L547] return 0; [L547] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 167 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 12 QuantifiedInterpolants, 526 SizeOfPredicates, 66 NumberOfNonLiveVariables, 546 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 18:33:30,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample