./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 eb692b52 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-?-eb692b5 [2022-07-20 05:36:02,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:36:02,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:36:02,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:36:02,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:36:02,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:36:02,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:36:02,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:36:02,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:36:02,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:36:02,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:36:02,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:36:02,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:36:02,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:36:02,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:36:02,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:36:02,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:36:02,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:36:02,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:36:02,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:36:02,585 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:36:02,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:36:02,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:36:02,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:36:02,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:36:02,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:36:02,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:36:02,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:36:02,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:36:02,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:36:02,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:36:02,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:36:02,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:36:02,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:36:02,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:36:02,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:36:02,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:36:02,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:36:02,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:36:02,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:36:02,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:36:02,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:36:02,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:36:02,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:36:02,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:36:02,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:36:02,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:36:02,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:36:02,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:36:02,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:36:02,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:36:02,622 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:36:02,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:36:02,623 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:36:02,624 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:36:02,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:36:02,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:36:02,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:36:02,624 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:36:02,624 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:36:02,625 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:36:02,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:36:02,626 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:36:02,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:36:02,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:36:02,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:36:02,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:36:02,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:36:02,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:36:02,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:36:02,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:36:02,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:36:02,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:36:02,628 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-20 05:36:02,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:36:02,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:36:02,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:36:02,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:36:02,843 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:36:02,844 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-20 05:36:02,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f9bba3a/e13cd6b155c84db79dfa33ec9b71559d/FLAG6224a6e6c [2022-07-20 05:36:03,429 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:36:03,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2022-07-20 05:36:03,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f9bba3a/e13cd6b155c84db79dfa33ec9b71559d/FLAG6224a6e6c [2022-07-20 05:36:03,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f9bba3a/e13cd6b155c84db79dfa33ec9b71559d [2022-07-20 05:36:03,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:36:03,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:36:03,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:03,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:36:03,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:36:03,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:03" (1/1) ... [2022-07-20 05:36:03,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d094770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:03, skipping insertion in model container [2022-07-20 05:36:03,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:03" (1/1) ... [2022-07-20 05:36:03,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:36:03,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:36:04,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:04,288 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:36:04,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:04,360 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:36:04,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04 WrapperNode [2022-07-20 05:36:04,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:04,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:04,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:36:04,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:36:04,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,418 INFO L137 Inliner]: procedures = 125, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2022-07-20 05:36:04,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:04,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:36:04,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:36:04,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:36:04,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:36:04,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:36:04,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:36:04,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:36:04,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (1/1) ... [2022-07-20 05:36:04,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:36:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:36:04,492 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-20 05:36:04,508 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-20 05:36:04,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:36:04,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:36:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:36:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:36:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:36:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:36:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:36:04,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:36:04,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:36:04,668 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:36:04,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:36:04,866 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:36:04,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:36:04,873 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 05:36:04,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:04 BoogieIcfgContainer [2022-07-20 05:36:04,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:36:04,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:36:04,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:36:04,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:36:04,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:36:03" (1/3) ... [2022-07-20 05:36:04,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607ff44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:04, skipping insertion in model container [2022-07-20 05:36:04,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:04" (2/3) ... [2022-07-20 05:36:04,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607ff44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:04, skipping insertion in model container [2022-07-20 05:36:04,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:04" (3/3) ... [2022-07-20 05:36:04,885 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2022-07-20 05:36:04,898 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:36:04,898 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-07-20 05:36:04,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:36:04,956 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@192d4cd6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8d08171 [2022-07-20 05:36:04,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-07-20 05:36:04,959 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-20 05:36:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:36:04,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:04,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:36:04,965 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-20 05:36:04,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:36:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:04,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335591532] [2022-07-20 05:36:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,156 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-20 05:36:05,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:05,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335591532] [2022-07-20 05:36:05,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335591532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:05,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:05,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868277867] [2022-07-20 05:36:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:05,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:05,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:05,195 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-20 05:36:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:05,256 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-07-20 05:36:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:05,258 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-20 05:36:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:05,264 INFO L225 Difference]: With dead ends: 48 [2022-07-20 05:36:05,264 INFO L226 Difference]: Without dead ends: 46 [2022-07-20 05:36:05,266 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-20 05:36:05,269 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:05,270 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.0s Time] [2022-07-20 05:36:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-20 05:36:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-07-20 05:36:05,294 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-20 05:36:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-07-20 05:36:05,296 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2022-07-20 05:36:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:05,296 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-07-20 05:36:05,297 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-20 05:36:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-07-20 05:36:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:36:05,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:05,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:36:05,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:36:05,298 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-20 05:36:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:36:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762605276] [2022-07-20 05:36:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,345 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-20 05:36:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:05,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762605276] [2022-07-20 05:36:05,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762605276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:05,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:05,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62176593] [2022-07-20 05:36:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:05,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:05,350 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-20 05:36:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:05,395 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-07-20 05:36:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:05,396 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-20 05:36:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:05,396 INFO L225 Difference]: With dead ends: 38 [2022-07-20 05:36:05,397 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 05:36:05,397 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-20 05:36:05,398 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-20 05:36:05,399 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-20 05:36:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 05:36:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-20 05:36:05,402 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-20 05:36:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-07-20 05:36:05,403 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2022-07-20 05:36:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:05,403 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-07-20 05:36:05,404 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-20 05:36:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-07-20 05:36:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:36:05,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:05,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:36:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:36:05,405 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-20 05:36:05,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-07-20 05:36:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48015079] [2022-07-20 05:36:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,472 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-20 05:36:05,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:05,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48015079] [2022-07-20 05:36:05,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48015079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:05,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:05,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:36:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445319989] [2022-07-20 05:36:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:36:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:05,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:36:05,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:36:05,475 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-20 05:36:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:05,517 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-07-20 05:36:05,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:36:05,518 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-20 05:36:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:05,519 INFO L225 Difference]: With dead ends: 44 [2022-07-20 05:36:05,519 INFO L226 Difference]: Without dead ends: 44 [2022-07-20 05:36:05,519 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-20 05:36:05,521 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-20 05:36:05,521 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-20 05:36:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-20 05:36:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-07-20 05:36:05,524 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-20 05:36:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-07-20 05:36:05,525 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2022-07-20 05:36:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:05,526 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-07-20 05:36:05,526 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-20 05:36:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-07-20 05:36:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:36:05,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:05,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:05,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:36:05,527 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-20 05:36:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,528 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-07-20 05:36:05,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:05,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333225058] [2022-07-20 05:36:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:05,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,626 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-20 05:36:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:05,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333225058] [2022-07-20 05:36:05,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333225058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:05,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:05,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:36:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092152636] [2022-07-20 05:36:05,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:05,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:05,628 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-20 05:36:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:05,706 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-07-20 05:36:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:36:05,706 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-20 05:36:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:05,707 INFO L225 Difference]: With dead ends: 39 [2022-07-20 05:36:05,708 INFO L226 Difference]: Without dead ends: 39 [2022-07-20 05:36:05,709 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-20 05:36:05,710 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-20 05:36:05,712 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-20 05:36:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-20 05:36:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-20 05:36:05,717 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-20 05:36:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-20 05:36:05,718 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2022-07-20 05:36:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:05,718 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-20 05:36:05,718 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-20 05:36:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-20 05:36:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:36:05,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:05,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:05,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:36:05,720 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-20 05:36:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-07-20 05:36:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:05,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20158580] [2022-07-20 05:36:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,813 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-20 05:36:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:05,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20158580] [2022-07-20 05:36:05,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20158580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:05,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:05,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:36:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276032715] [2022-07-20 05:36:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:05,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:05,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:05,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:05,817 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-20 05:36:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:05,885 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-07-20 05:36:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:36:05,885 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-20 05:36:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:05,886 INFO L225 Difference]: With dead ends: 31 [2022-07-20 05:36:05,887 INFO L226 Difference]: Without dead ends: 31 [2022-07-20 05:36:05,887 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-20 05:36:05,891 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-20 05:36:05,892 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-20 05:36:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-20 05:36:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-20 05:36:05,898 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-20 05:36:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-20 05:36:05,899 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2022-07-20 05:36:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:05,900 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-20 05:36:05,900 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-20 05:36:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-20 05:36:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:36:05,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:05,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:05,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:36:05,904 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-20 05:36:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2022-07-20 05:36:05,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:05,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972384833] [2022-07-20 05:36:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:05,993 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-20 05:36:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:05,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972384833] [2022-07-20 05:36:05,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972384833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:05,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:05,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:36:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880949031] [2022-07-20 05:36:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:05,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:36:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:36:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:36:05,996 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-20 05:36:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:06,107 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-07-20 05:36:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:36:06,107 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-20 05:36:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:06,108 INFO L225 Difference]: With dead ends: 30 [2022-07-20 05:36:06,108 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 05:36:06,108 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-20 05:36:06,109 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-20 05:36:06,110 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-20 05:36:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 05:36:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-20 05:36:06,112 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-20 05:36:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-07-20 05:36:06,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2022-07-20 05:36:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:06,113 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-07-20 05:36:06,113 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-20 05:36:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-07-20 05:36:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:36:06,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:06,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:06,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:36:06,114 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-20 05:36:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2022-07-20 05:36:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:06,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662873321] [2022-07-20 05:36:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:06,217 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-20 05:36:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:06,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662873321] [2022-07-20 05:36:06,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662873321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:06,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:06,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:36:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621095525] [2022-07-20 05:36:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:06,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:36:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:06,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:36:06,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:36:06,220 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-20 05:36:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:06,322 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-07-20 05:36:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:36:06,322 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-20 05:36:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:06,323 INFO L225 Difference]: With dead ends: 29 [2022-07-20 05:36:06,323 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 05:36:06,323 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-20 05:36:06,324 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:06,324 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.1s Time] [2022-07-20 05:36:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 05:36:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-20 05:36:06,326 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-20 05:36:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-07-20 05:36:06,327 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 14 [2022-07-20 05:36:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:06,327 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-07-20 05:36:06,328 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-20 05:36:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-07-20 05:36:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:36:06,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:06,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:06,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:36:06,329 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-20 05:36:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2022-07-20 05:36:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:06,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029531509] [2022-07-20 05:36:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:06,416 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-20 05:36:06,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:36:06,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029531509] [2022-07-20 05:36:06,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029531509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:06,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:06,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:36:06,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594947348] [2022-07-20 05:36:06,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:06,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:36:06,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:36:06,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:36:06,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:36:06,419 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-20 05:36:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:06,525 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-07-20 05:36:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:36:06,525 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-20 05:36:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:06,526 INFO L225 Difference]: With dead ends: 30 [2022-07-20 05:36:06,526 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 05:36:06,526 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-20 05:36:06,527 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 05:36:06,527 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-20 05:36:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 05:36:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-20 05:36:06,529 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-20 05:36:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-07-20 05:36:06,530 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2022-07-20 05:36:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:06,530 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-07-20 05:36:06,531 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-20 05:36:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-07-20 05:36:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:36:06,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:06,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:06,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:36:06,532 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-20 05:36:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2022-07-20 05:36:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:36:06,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125300669] [2022-07-20 05:36:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:36:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:06,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:36:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:06,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 05:36:06,624 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:36:06,625 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2022-07-20 05:36:06,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2022-07-20 05:36:06,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2022-07-20 05:36:06,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2022-07-20 05:36:06,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2022-07-20 05:36:06,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2022-07-20 05:36:06,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2022-07-20 05:36:06,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2022-07-20 05:36:06,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2022-07-20 05:36:06,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2022-07-20 05:36:06,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2022-07-20 05:36:06,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2022-07-20 05:36:06,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2022-07-20 05:36:06,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2022-07-20 05:36:06,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2022-07-20 05:36:06,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2022-07-20 05:36:06,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2022-07-20 05:36:06,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2022-07-20 05:36:06,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2022-07-20 05:36:06,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:36:06,632 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:06,635 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:36:06,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:36:06 BoogieIcfgContainer [2022-07-20 05:36:06,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:36:06,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:36:06,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:36:06,659 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:36:06,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:04" (3/4) ... [2022-07-20 05:36:06,661 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 05:36:06,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:36:06,662 INFO L158 Benchmark]: Toolchain (without parser) took 2752.39ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 64.6MB in the beginning and 89.1MB in the end (delta: -24.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:06,662 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:06,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.87ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 64.4MB in the beginning and 90.1MB in the end (delta: -25.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:36:06,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.68ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:06,663 INFO L158 Benchmark]: Boogie Preprocessor took 40.04ms. Allocated memory is still 121.6MB. Free memory was 88.1MB in the beginning and 86.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:06,663 INFO L158 Benchmark]: RCFGBuilder took 414.11ms. Allocated memory is still 121.6MB. Free memory was 86.9MB in the beginning and 74.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-20 05:36:06,663 INFO L158 Benchmark]: TraceAbstraction took 1781.72ms. Allocated memory is still 121.6MB. Free memory was 74.1MB in the beginning and 89.1MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:06,663 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 121.6MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:06,665 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.17ms. Allocated memory is still 96.5MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.87ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 64.4MB in the beginning and 90.1MB in the end (delta: -25.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.68ms. Allocated memory is still 121.6MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.04ms. Allocated memory is still 121.6MB. Free memory was 88.1MB in the beginning and 86.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 414.11ms. Allocated memory is still 121.6MB. Free memory was 86.9MB in the beginning and 74.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1781.72ms. Allocated memory is still 121.6MB. Free memory was 74.1MB in the beginning and 89.1MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 121.6MB. Free memory is still 89.1MB. 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.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.4s 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-20 05:36:06,695 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-?-eb692b5 [2022-07-20 05:36:08,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:36:08,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:36:08,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:36:08,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:36:08,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:36:08,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:36:08,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:36:08,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:36:08,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:36:08,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:36:08,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:36:08,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:36:08,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:36:08,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:36:08,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:36:08,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:36:08,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:36:08,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:36:08,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:36:08,737 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:36:08,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:36:08,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:36:08,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:36:08,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:36:08,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:36:08,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:36:08,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:36:08,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:36:08,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:36:08,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:36:08,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:36:08,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:36:08,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:36:08,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:36:08,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:36:08,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:36:08,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:36:08,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:36:08,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:36:08,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:36:08,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:36:08,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:36:08,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:36:08,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:36:08,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:36:08,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:36:08,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:36:08,804 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:36:08,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:36:08,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:36:08,805 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:36:08,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:36:08,806 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:36:08,806 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:36:08,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:36:08,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:36:08,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:36:08,807 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:36:08,812 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:36:08,813 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:36:08,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:36:08,813 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:36:08,813 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:36:08,813 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:36:08,814 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:36:08,814 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:36:08,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:36:08,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:36:08,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:36:08,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:36:08,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:36:08,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:36:08,816 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:36:08,816 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:36:08,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:36:08,816 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-20 05:36:09,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:36:09,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:36:09,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:36:09,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:36:09,160 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:36:09,161 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-20 05:36:09,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15528ced0/7d7f75cd3e174c7f8095d09c971e5560/FLAG130c1b7ed [2022-07-20 05:36:09,733 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:36:09,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2022-07-20 05:36:09,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15528ced0/7d7f75cd3e174c7f8095d09c971e5560/FLAG130c1b7ed [2022-07-20 05:36:10,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15528ced0/7d7f75cd3e174c7f8095d09c971e5560 [2022-07-20 05:36:10,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:36:10,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:36:10,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:10,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:36:10,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:36:10,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efafbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10, skipping insertion in model container [2022-07-20 05:36:10,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:36:10,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:36:10,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:10,587 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:36:10,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:36:10,662 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:36:10,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10 WrapperNode [2022-07-20 05:36:10,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:36:10,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:10,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:36:10,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:36:10,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,723 INFO L137 Inliner]: procedures = 126, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2022-07-20 05:36:10,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:36:10,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:36:10,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:36:10,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:36:10,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:36:10,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:36:10,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:36:10,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:36:10,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (1/1) ... [2022-07-20 05:36:10,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:36:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:36:10,798 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-20 05:36:10,809 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-20 05:36:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:36:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:36:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:36:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:36:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:36:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:36:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 05:36:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:36:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:36:10,992 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:36:11,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:36:11,283 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:36:11,288 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:36:11,288 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 05:36:11,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:11 BoogieIcfgContainer [2022-07-20 05:36:11,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:36:11,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:36:11,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:36:11,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:36:11,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:36:10" (1/3) ... [2022-07-20 05:36:11,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c724d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:11, skipping insertion in model container [2022-07-20 05:36:11,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:36:10" (2/3) ... [2022-07-20 05:36:11,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c724d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:36:11, skipping insertion in model container [2022-07-20 05:36:11,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:11" (3/3) ... [2022-07-20 05:36:11,304 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2022-07-20 05:36:11,316 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:36:11,317 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-07-20 05:36:11,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:36:11,376 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@4ee4d971, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6598f91c [2022-07-20 05:36:11,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-07-20 05:36:11,382 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-20 05:36:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:36:11,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:11,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:36:11,388 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-20 05:36:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:36:11,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:11,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543281980] [2022-07-20 05:36:11,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:11,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:11,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:11,413 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-20 05:36:11,415 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-20 05:36:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:11,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:36:11,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:11,633 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:36:11,634 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-20 05:36:11,663 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-20 05:36:11,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:11,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:11,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543281980] [2022-07-20 05:36:11,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543281980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:11,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:11,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:11,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53602678] [2022-07-20 05:36:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:11,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:11,700 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-20 05:36:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:11,796 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-07-20 05:36:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:11,801 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-20 05:36:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:11,806 INFO L225 Difference]: With dead ends: 48 [2022-07-20 05:36:11,807 INFO L226 Difference]: Without dead ends: 46 [2022-07-20 05:36:11,808 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-20 05:36:11,810 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-20 05:36:11,811 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-20 05:36:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-20 05:36:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-07-20 05:36:11,835 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-20 05:36:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-07-20 05:36:11,837 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 3 [2022-07-20 05:36:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:11,837 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-07-20 05:36:11,837 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-20 05:36:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-07-20 05:36:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:36:11,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:11,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:36:11,850 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-20 05:36:12,048 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-20 05:36:12,048 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-20 05:36:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:36:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726603174] [2022-07-20 05:36:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:12,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:12,051 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-20 05:36:12,053 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-20 05:36:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:12,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:36:12,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:12,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:12,132 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-20 05:36:12,139 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-20 05:36:12,153 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-20 05:36:12,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:12,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:12,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726603174] [2022-07-20 05:36:12,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726603174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:12,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:12,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:36:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415928398] [2022-07-20 05:36:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:12,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:36:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:12,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:36:12,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:36:12,157 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-20 05:36:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:12,211 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-07-20 05:36:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:36:12,212 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-20 05:36:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:12,212 INFO L225 Difference]: With dead ends: 38 [2022-07-20 05:36:12,212 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 05:36:12,213 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-20 05:36:12,214 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-20 05:36:12,214 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-20 05:36:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 05:36:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-20 05:36:12,218 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-20 05:36:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-07-20 05:36:12,219 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2022-07-20 05:36:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:12,219 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-07-20 05:36:12,220 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-20 05:36:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-07-20 05:36:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:36:12,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:12,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:36:12,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:12,421 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-20 05:36:12,421 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-20 05:36:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-07-20 05:36:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:12,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828620705] [2022-07-20 05:36:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:12,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:12,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:12,424 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-20 05:36:12,427 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-20 05:36:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:12,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:36:12,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:12,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:12,525 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-20 05:36:12,530 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-20 05:36:12,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:36:12,570 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-20 05:36:12,580 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:36:12,581 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-20 05:36:12,587 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-20 05:36:12,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:12,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:12,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828620705] [2022-07-20 05:36:12,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828620705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:12,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:12,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:36:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581100644] [2022-07-20 05:36:12,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:12,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:36:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:36:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:36:12,590 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-20 05:36:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:12,688 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-07-20 05:36:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:36:12,689 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-20 05:36:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:12,690 INFO L225 Difference]: With dead ends: 44 [2022-07-20 05:36:12,690 INFO L226 Difference]: Without dead ends: 44 [2022-07-20 05:36:12,690 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-20 05:36:12,691 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-20 05:36:12,692 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-20 05:36:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-20 05:36:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-07-20 05:36:12,695 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-20 05:36:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-07-20 05:36:12,695 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2022-07-20 05:36:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:12,696 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-07-20 05:36:12,696 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-20 05:36:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-07-20 05:36:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:36:12,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:12,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:12,708 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-20 05:36:12,906 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-20 05:36:12,906 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-20 05:36:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 59200011, now seen corresponding path program 1 times [2022-07-20 05:36:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:12,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163281837] [2022-07-20 05:36:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:12,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:12,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:12,909 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-20 05:36:12,911 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-20 05:36:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:12,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:36:12,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:13,007 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-20 05:36:13,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:13,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:13,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163281837] [2022-07-20 05:36:13,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163281837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:13,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:13,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:36:13,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686159286] [2022-07-20 05:36:13,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:13,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:13,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:13,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:13,011 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-20 05:36:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:13,158 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-07-20 05:36:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:36:13,159 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-20 05:36:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:13,159 INFO L225 Difference]: With dead ends: 39 [2022-07-20 05:36:13,160 INFO L226 Difference]: Without dead ends: 39 [2022-07-20 05:36:13,160 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-20 05:36:13,161 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-20 05:36:13,161 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-20 05:36:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-20 05:36:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-20 05:36:13,164 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-20 05:36:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-20 05:36:13,165 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2022-07-20 05:36:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:13,165 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-20 05:36:13,165 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-20 05:36:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-20 05:36:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:36:13,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:13,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:13,181 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-20 05:36:13,366 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-20 05:36:13,367 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-20 05:36:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 59200012, now seen corresponding path program 1 times [2022-07-20 05:36:13,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:13,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950670131] [2022-07-20 05:36:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:13,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:13,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:13,369 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-20 05:36:13,372 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-20 05:36:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:13,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:36:13,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:13,519 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-20 05:36:13,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:13,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:13,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950670131] [2022-07-20 05:36:13,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950670131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:13,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:13,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:36:13,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532435321] [2022-07-20 05:36:13,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:13,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:36:13,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:36:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:36:13,523 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-20 05:36:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:13,619 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-07-20 05:36:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:36:13,620 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-20 05:36:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:13,620 INFO L225 Difference]: With dead ends: 31 [2022-07-20 05:36:13,620 INFO L226 Difference]: Without dead ends: 31 [2022-07-20 05:36:13,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:36:13,622 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:13,622 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.1s Time] [2022-07-20 05:36:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-20 05:36:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-20 05:36:13,625 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-20 05:36:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-07-20 05:36:13,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 8 [2022-07-20 05:36:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:13,626 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-07-20 05:36:13,626 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-20 05:36:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-07-20 05:36:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:36:13,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:13,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:13,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-20 05:36:13,840 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-20 05:36:13,841 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-20 05:36:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash 406185098, now seen corresponding path program 1 times [2022-07-20 05:36:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090924459] [2022-07-20 05:36:13,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:13,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:13,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:13,843 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-20 05:36:13,844 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-20 05:36:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:13,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:36:13,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:13,946 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-20 05:36:13,983 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-20 05:36:14,015 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-20 05:36:14,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:14,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:14,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090924459] [2022-07-20 05:36:14,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090924459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:14,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:14,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:36:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410796980] [2022-07-20 05:36:14,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:14,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:36:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:36:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:36:14,018 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-20 05:36:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:14,352 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-07-20 05:36:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:36:14,353 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-20 05:36:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:14,353 INFO L225 Difference]: With dead ends: 33 [2022-07-20 05:36:14,353 INFO L226 Difference]: Without dead ends: 33 [2022-07-20 05:36:14,354 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-20 05:36:14,354 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.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:36:14,355 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.2s Time] [2022-07-20 05:36:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-20 05:36:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-07-20 05:36:14,357 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-20 05:36:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-07-20 05:36:14,358 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 13 [2022-07-20 05:36:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:14,358 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-07-20 05:36:14,358 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-20 05:36:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-07-20 05:36:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:36:14,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:14,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:14,371 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-20 05:36:14,565 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-20 05:36:14,566 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-20 05:36:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash -293163793, now seen corresponding path program 1 times [2022-07-20 05:36:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:14,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594222009] [2022-07-20 05:36:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:14,568 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-20 05:36:14,569 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-20 05:36:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:14,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 05:36:14,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:14,771 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-20 05:36:14,907 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-20 05:36:15,028 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-20 05:36:15,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:15,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:15,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594222009] [2022-07-20 05:36:15,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594222009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:15,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:15,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:36:15,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099256344] [2022-07-20 05:36:15,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:15,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:36:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:15,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:36:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:36:15,030 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-20 05:36:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:15,040 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2022-07-20 05:36:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:36:15,041 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-20 05:36:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:15,041 INFO L225 Difference]: With dead ends: 32 [2022-07-20 05:36:15,041 INFO L226 Difference]: Without dead ends: 32 [2022-07-20 05:36:15,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:36:15,042 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-20 05:36:15,043 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-20 05:36:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-20 05:36:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-07-20 05:36:15,045 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-20 05:36:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-07-20 05:36:15,045 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 14 [2022-07-20 05:36:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:15,045 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-07-20 05:36:15,045 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-20 05:36:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-07-20 05:36:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:36:15,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:15,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:15,060 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-20 05:36:15,246 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-20 05:36:15,247 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-20 05:36:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -498142932, now seen corresponding path program 1 times [2022-07-20 05:36:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:15,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764071329] [2022-07-20 05:36:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:15,249 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-20 05:36:15,250 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-20 05:36:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:36:15,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:36:15,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:36:15,354 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-20 05:36:15,375 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-20 05:36:15,423 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-20 05:36:15,466 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-20 05:36:15,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:36:15,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:36:15,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764071329] [2022-07-20 05:36:15,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764071329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:36:15,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:36:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:36:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623181391] [2022-07-20 05:36:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:36:15,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:36:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:36:15,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:36:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:36:15,468 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-20 05:36:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:36:15,851 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-07-20 05:36:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:36:15,853 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-20 05:36:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:36:15,853 INFO L225 Difference]: With dead ends: 29 [2022-07-20 05:36:15,853 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 05:36:15,854 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-20 05:36:15,854 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-20 05:36:15,854 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-20 05:36:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 05:36:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-20 05:36:15,856 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-20 05:36:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-07-20 05:36:15,857 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 15 [2022-07-20 05:36:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:36:15,857 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-07-20 05:36:15,857 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-20 05:36:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-07-20 05:36:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:36:15,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:36:15,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:15,871 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-20 05:36:16,058 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-20 05:36:16,058 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-20 05:36:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:36:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1750799681, now seen corresponding path program 1 times [2022-07-20 05:36:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:36:16,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849372411] [2022-07-20 05:36:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:36:16,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:36:16,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:36:16,060 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-20 05:36:16,062 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-20 05:36:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:16,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 05:36:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 05:36:16,227 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-20 05:36:16,227 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 05:36:16,228 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (18 of 19 remaining) [2022-07-20 05:36:16,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2022-07-20 05:36:16,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2022-07-20 05:36:16,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2022-07-20 05:36:16,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2022-07-20 05:36:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2022-07-20 05:36:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2022-07-20 05:36:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2022-07-20 05:36:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2022-07-20 05:36:16,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (9 of 19 remaining) [2022-07-20 05:36:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (8 of 19 remaining) [2022-07-20 05:36:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (7 of 19 remaining) [2022-07-20 05:36:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (6 of 19 remaining) [2022-07-20 05:36:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (5 of 19 remaining) [2022-07-20 05:36:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (4 of 19 remaining) [2022-07-20 05:36:16,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2022-07-20 05:36:16,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2022-07-20 05:36:16,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2022-07-20 05:36:16,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2022-07-20 05:36:16,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:36:16,433 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-20 05:36:16,437 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:36:16,448 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 05:36:16,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:36:16 BoogieIcfgContainer [2022-07-20 05:36:16,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 05:36:16,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 05:36:16,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 05:36:16,479 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 05:36:16,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:36:11" (3/4) ... [2022-07-20 05:36:16,482 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 05:36:16,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 05:36:16,483 INFO L158 Benchmark]: Toolchain (without parser) took 6245.86ms. Allocated memory was 50.3MB in the beginning and 75.5MB in the end (delta: 25.2MB). Free memory was 26.1MB in the beginning and 54.3MB in the end (delta: -28.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:16,483 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory was 32.6MB in the beginning and 32.6MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:16,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.12ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 25.9MB in the beginning and 38.4MB in the end (delta: -12.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-20 05:36:16,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.96ms. Allocated memory is still 62.9MB. Free memory was 38.4MB in the beginning and 36.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:36:16,486 INFO L158 Benchmark]: Boogie Preprocessor took 31.72ms. Allocated memory is still 62.9MB. Free memory was 36.5MB in the beginning and 34.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:16,486 INFO L158 Benchmark]: RCFGBuilder took 539.18ms. Allocated memory is still 62.9MB. Free memory was 34.9MB in the beginning and 36.4MB in the end (delta: -1.4MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-07-20 05:36:16,486 INFO L158 Benchmark]: TraceAbstraction took 5179.60ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 54.8MB in the end (delta: -18.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-20 05:36:16,487 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 75.5MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:36:16,492 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.20ms. Allocated memory is still 50.3MB. Free memory was 32.6MB in the beginning and 32.6MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.12ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 25.9MB in the beginning and 38.4MB in the end (delta: -12.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.96ms. Allocated memory is still 62.9MB. Free memory was 38.4MB in the beginning and 36.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.72ms. Allocated memory is still 62.9MB. Free memory was 36.5MB in the beginning and 34.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 539.18ms. Allocated memory is still 62.9MB. Free memory was 34.9MB in the beginning and 36.4MB in the end (delta: -1.4MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5179.60ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 54.8MB in the end (delta: -18.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 75.5MB. Free memory is still 54.3MB. 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: 5.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 372 SdHoareTripleChecker+Invalid, 0.7s 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.7s 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, 1.1s 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-20 05:36:16,538 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