./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/simple-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/list-properties/simple-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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:21:11,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:21:11,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:21:11,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:21:11,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:21:11,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:21:11,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:21:11,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:21:11,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:21:11,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:21:11,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:21:11,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:21:11,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:21:11,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:21:11,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:21:11,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:21:11,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:21:11,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:21:11,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:21:11,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:21:11,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:21:11,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:21:11,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:21:11,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:21:11,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:21:11,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:21:11,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:21:11,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:21:11,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:21:11,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:21:11,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:21:11,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:21:11,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:21:11,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:21:11,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:21:11,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:21:11,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:21:11,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:21:11,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:21:11,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:21:11,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:21:11,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:21:11,447 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:21:11,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:21:11,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:21:11,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:21:11,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:21:11,449 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:21:11,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:21:11,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:21:11,450 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:21:11,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:21:11,451 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:21:11,451 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:21:11,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:21:11,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:21:11,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:21:11,452 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:21:11,452 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:21:11,452 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:21:11,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:21:11,453 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:21:11,453 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:21:11,453 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:21:11,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:21:11,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:21:11,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:21:11,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:11,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:21:11,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:21:11,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:21:11,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:21:11,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:21:11,455 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:21:11,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:21:11,455 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:21:11,455 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2023-02-15 22:21:11,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:21:11,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:21:11,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:21:11,751 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:21:11,751 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:21:11,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2023-02-15 22:21:12,876 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:21:13,116 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:21:13,119 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2023-02-15 22:21:13,129 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3375b0af9/04a8f7002d9043b9839242615c7363cc/FLAGe780b720b [2023-02-15 22:21:13,146 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3375b0af9/04a8f7002d9043b9839242615c7363cc [2023-02-15 22:21:13,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:21:13,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:21:13,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:13,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:21:13,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:21:13,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d70967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13, skipping insertion in model container [2023-02-15 22:21:13,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:21:13,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:21:13,422 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-02-15 22:21:13,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:13,435 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:21:13,536 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-02-15 22:21:13,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:13,570 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:21:13,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13 WrapperNode [2023-02-15 22:21:13,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:13,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:13,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:21:13,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:21:13,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,604 INFO L138 Inliner]: procedures = 124, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-02-15 22:21:13,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:13,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:21:13,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:21:13,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:21:13,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,640 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:21:13,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:21:13,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:21:13,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:21:13,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (1/1) ... [2023-02-15 22:21:13,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:13,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:13,671 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) [2023-02-15 22:21:13,693 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 [2023-02-15 22:21:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 22:21:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 22:21:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:21:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:21:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:21:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:21:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:21:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:21:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:21:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:21:13,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:21:13,823 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:21:13,825 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:21:13,862 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 22:21:14,004 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:21:14,009 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:21:14,009 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:21:14,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:14 BoogieIcfgContainer [2023-02-15 22:21:14,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:21:14,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:21:14,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:21:14,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:21:14,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:21:13" (1/3) ... [2023-02-15 22:21:14,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729313e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:14, skipping insertion in model container [2023-02-15 22:21:14,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:13" (2/3) ... [2023-02-15 22:21:14,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729313e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:14, skipping insertion in model container [2023-02-15 22:21:14,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:14" (3/3) ... [2023-02-15 22:21:14,018 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-02-15 22:21:14,031 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:21:14,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 22:21:14,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:21:14,068 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61c5237f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:21:14,068 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 22:21:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:14,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:14,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:14,080 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517224, now seen corresponding path program 1 times [2023-02-15 22:21:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:14,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358336678] [2023-02-15 22:21:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358336678] [2023-02-15 22:21:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358336678] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:21:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126046208] [2023-02-15 22:21:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:14,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:21:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:21:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:21:14,300 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 43 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-02-15 22:21:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:14,315 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2023-02-15 22:21:14,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:21:14,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-02-15 22:21:14,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:14,325 INFO L225 Difference]: With dead ends: 45 [2023-02-15 22:21:14,325 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 22:21:14,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:21:14,330 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:14,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 22:21:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-15 22:21:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 38 states have internal predecessors, (40), 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) [2023-02-15 22:21:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-02-15 22:21:14,352 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 6 [2023-02-15 22:21:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:14,352 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-02-15 22:21:14,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2023-02-15 22:21:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-02-15 22:21:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:21:14,353 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:14,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:14,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:21:14,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238120, now seen corresponding path program 1 times [2023-02-15 22:21:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:14,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172675881] [2023-02-15 22:21:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:14,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:14,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172675881] [2023-02-15 22:21:14,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172675881] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:14,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:14,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107874607] [2023-02-15 22:21:14,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:14,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:14,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:14,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:14,503 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 22:21:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:14,589 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-02-15 22:21:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:14,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-02-15 22:21:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:14,590 INFO L225 Difference]: With dead ends: 47 [2023-02-15 22:21:14,591 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 22:21:14,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:14,592 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:14,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 16 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 22:21:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2023-02-15 22:21:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 40 states have internal predecessors, (47), 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) [2023-02-15 22:21:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-15 22:21:14,604 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 7 [2023-02-15 22:21:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:14,605 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-15 22:21:14,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 22:21:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-15 22:21:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 22:21:14,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:14,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:14,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:21:14,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:14,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238121, now seen corresponding path program 1 times [2023-02-15 22:21:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:14,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057684705] [2023-02-15 22:21:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:14,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:14,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057684705] [2023-02-15 22:21:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057684705] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:14,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:14,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290482840] [2023-02-15 22:21:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:14,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:14,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:14,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:14,741 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 22:21:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:14,820 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2023-02-15 22:21:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-02-15 22:21:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:14,823 INFO L225 Difference]: With dead ends: 56 [2023-02-15 22:21:14,823 INFO L226 Difference]: Without dead ends: 56 [2023-02-15 22:21:14,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:14,829 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:14,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 25 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-15 22:21:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-02-15 22:21:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 47 states have internal predecessors, (52), 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) [2023-02-15 22:21:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-15 22:21:14,846 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2023-02-15 22:21:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:14,847 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-15 22:21:14,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2023-02-15 22:21:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-15 22:21:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:21:14,848 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:14,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:14,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:21:14,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1884133396, now seen corresponding path program 1 times [2023-02-15 22:21:14,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:14,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315425428] [2023-02-15 22:21:14,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:14,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315425428] [2023-02-15 22:21:14,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315425428] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:14,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:14,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:21:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808803828] [2023-02-15 22:21:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:14,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:14,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:14,917 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-02-15 22:21:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:14,967 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2023-02-15 22:21:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-02-15 22:21:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:14,969 INFO L225 Difference]: With dead ends: 53 [2023-02-15 22:21:14,969 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 22:21:14,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:14,978 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:14,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 37 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:21:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 22:21:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2023-02-15 22:21:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 47 states have internal predecessors, (51), 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) [2023-02-15 22:21:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-02-15 22:21:14,987 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 12 [2023-02-15 22:21:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:14,987 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-02-15 22:21:14,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-02-15 22:21:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-02-15 22:21:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:21:14,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:14,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:14,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:21:14,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1721365971, now seen corresponding path program 1 times [2023-02-15 22:21:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406111054] [2023-02-15 22:21:14,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:15,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406111054] [2023-02-15 22:21:15,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406111054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:15,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:15,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:21:15,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319211286] [2023-02-15 22:21:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:15,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:21:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:21:15,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:21:15,161 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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) [2023-02-15 22:21:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:15,269 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-15 22:21:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:21:15,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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 [2023-02-15 22:21:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:15,273 INFO L225 Difference]: With dead ends: 85 [2023-02-15 22:21:15,273 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 22:21:15,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:21:15,274 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:15,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 99 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 22:21:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2023-02-15 22:21:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.375) internal successors, (55), 51 states have internal predecessors, (55), 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) [2023-02-15 22:21:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2023-02-15 22:21:15,289 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 13 [2023-02-15 22:21:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:15,289 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-02-15 22:21:15,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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) [2023-02-15 22:21:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2023-02-15 22:21:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:21:15,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:15,290 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:15,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:21:15,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash 761251611, now seen corresponding path program 1 times [2023-02-15 22:21:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:15,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018602124] [2023-02-15 22:21:15,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:15,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:15,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018602124] [2023-02-15 22:21:15,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018602124] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:15,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:15,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680219250] [2023-02-15 22:21:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:15,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:15,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:15,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:15,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:15,432 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) [2023-02-15 22:21:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:15,538 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-02-15 22:21:15,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:21:15,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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 [2023-02-15 22:21:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:15,540 INFO L225 Difference]: With dead ends: 64 [2023-02-15 22:21:15,540 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 22:21:15,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:21:15,541 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:15,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 93 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 22:21:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2023-02-15 22:21:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.325) internal successors, (53), 49 states have internal predecessors, (53), 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) [2023-02-15 22:21:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-15 22:21:15,554 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2023-02-15 22:21:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:15,554 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-15 22:21:15,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) [2023-02-15 22:21:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-15 22:21:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:21:15,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:15,555 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:15,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:21:15,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash 761251612, now seen corresponding path program 1 times [2023-02-15 22:21:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:15,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362536570] [2023-02-15 22:21:15,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:15,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:15,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:15,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362536570] [2023-02-15 22:21:15,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362536570] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:15,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:15,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490475873] [2023-02-15 22:21:15,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:15,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:15,758 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) [2023-02-15 22:21:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:15,912 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-02-15 22:21:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:21:15,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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 [2023-02-15 22:21:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:15,913 INFO L225 Difference]: With dead ends: 60 [2023-02-15 22:21:15,913 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 22:21:15,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:21:15,914 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:15,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 111 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 22:21:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2023-02-15 22:21:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 39 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) [2023-02-15 22:21:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-15 22:21:15,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2023-02-15 22:21:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:15,916 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-15 22:21:15,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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) [2023-02-15 22:21:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-15 22:21:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:21:15,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:15,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:15,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:21:15,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash 700715683, now seen corresponding path program 1 times [2023-02-15 22:21:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:15,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325067431] [2023-02-15 22:21:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:16,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325067431] [2023-02-15 22:21:16,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325067431] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:16,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296082368] [2023-02-15 22:21:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:16,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:16,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:16,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:21:16,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:21:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:16,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:21:16,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:16,363 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 22:21:16,368 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 22:21:16,438 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 22:21:16,440 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 22:21:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:16,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:16,600 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 21 [2023-02-15 22:21:16,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:16,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:16,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296082368] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:16,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:16,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2023-02-15 22:21:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807517216] [2023-02-15 22:21:16,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:16,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:21:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:21:16,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:21:16,734 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 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) [2023-02-15 22:21:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:16,941 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2023-02-15 22:21:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:21:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 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 16 [2023-02-15 22:21:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:16,943 INFO L225 Difference]: With dead ends: 55 [2023-02-15 22:21:16,943 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 22:21:16,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:21:16,944 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 129 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:16,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 127 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 22:21:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2023-02-15 22:21:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 42 states have internal predecessors, (46), 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) [2023-02-15 22:21:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-02-15 22:21:16,948 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 16 [2023-02-15 22:21:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:16,948 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-02-15 22:21:16,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 states have internal predecessors, (35), 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) [2023-02-15 22:21:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-02-15 22:21:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:21:16,949 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:16,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:16,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:21:17,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:17,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:17,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash 247348413, now seen corresponding path program 1 times [2023-02-15 22:21:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:17,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359233987] [2023-02-15 22:21:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:17,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:21:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:17,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 22:21:17,186 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:21:17,186 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-02-15 22:21:17,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-15 22:21:17,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-15 22:21:17,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-02-15 22:21:17,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-02-15 22:21:17,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-02-15 22:21:17,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-02-15 22:21:17,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-02-15 22:21:17,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-02-15 22:21:17,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-15 22:21:17,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-15 22:21:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-02-15 22:21:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2023-02-15 22:21:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (2 of 16 remaining) [2023-02-15 22:21:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-15 22:21:17,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2023-02-15 22:21:17,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:21:17,193 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:17,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:21:17,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:21:17 BoogieIcfgContainer [2023-02-15 22:21:17,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:21:17,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:21:17,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:21:17,217 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:21:17,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:14" (3/4) ... [2023-02-15 22:21:17,219 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:21:17,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:21:17,220 INFO L158 Benchmark]: Toolchain (without parser) took 4071.07ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 76.7MB in the beginning and 77.0MB in the end (delta: -331.2kB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-02-15 22:21:17,220 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:17,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.42ms. Allocated memory is still 119.5MB. Free memory was 76.7MB in the beginning and 87.4MB in the end (delta: -10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 22:21:17,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.39ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 85.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:21:17,221 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 119.5MB. Free memory was 85.9MB in the beginning and 84.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:17,221 INFO L158 Benchmark]: RCFGBuilder took 365.45ms. Allocated memory is still 119.5MB. Free memory was 84.4MB in the beginning and 70.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:21:17,222 INFO L158 Benchmark]: TraceAbstraction took 3203.18ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 70.0MB in the beginning and 77.0MB in the end (delta: -7.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 22:21:17,222 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 144.7MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:17,224 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 98.6MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.42ms. Allocated memory is still 119.5MB. Free memory was 76.7MB in the beginning and 87.4MB in the end (delta: -10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.39ms. Allocated memory is still 119.5MB. Free memory was 87.4MB in the beginning and 85.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 119.5MB. Free memory was 85.9MB in the beginning and 84.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.45ms. Allocated memory is still 119.5MB. Free memory was 84.4MB in the beginning and 70.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3203.18ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 70.0MB in the beginning and 77.0MB in the end (delta: -7.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 144.7MB. Free memory is still 77.0MB. 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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] p->h = 1 VAL [a={-1:0}, p={-1:0}] [L544] p->n = 0 VAL [a={-1:0}, p={-1:0}] [L545] p = a VAL [a={-1:0}, p={-1:0}] [L546] COND TRUE p!=0 VAL [a={-1:0}, p={-1:0}] [L547] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=1] [L547] COND FALSE !(p->h != 1) [L550] EXPR p->n VAL [a={-1:0}, p={-1:0}, p->n={0:0}] [L550] p = p->n [L546] COND FALSE !(p!=0) VAL [a={-1:0}, p={0:0}] [L552] return 0; VAL [\result=0, a={-1:0}, p={0: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: -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: 548]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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 2 procedures, 46 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 216 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 1 QuantifiedInterpolants, 879 SizeOfPredicates, 10 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 7/10 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 [2023-02-15 22:21:17,252 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/list-properties/simple-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 a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:21:19,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:21:19,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:21:19,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:21:19,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:21:19,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:21:19,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:21:19,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:21:19,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:21:19,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:21:19,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:21:19,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:21:19,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:21:19,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:21:19,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:21:19,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:21:19,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:21:19,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:21:19,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:21:19,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:21:19,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:21:19,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:21:19,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:21:19,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:21:19,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:21:19,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:21:19,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:21:19,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:21:19,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:21:19,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:21:19,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:21:19,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:21:19,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:21:19,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:21:19,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:21:19,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:21:19,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:21:19,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:21:19,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:21:19,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:21:19,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:21:19,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:21:19,434 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:21:19,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:21:19,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:21:19,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:21:19,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:21:19,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:21:19,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:21:19,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:21:19,438 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:21:19,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:21:19,439 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:21:19,439 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:21:19,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:21:19,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:21:19,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:21:19,440 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:21:19,441 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:21:19,441 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:21:19,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:21:19,441 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:21:19,441 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:21:19,442 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:21:19,442 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:21:19,442 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:21:19,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:21:19,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:21:19,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:21:19,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:19,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:21:19,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:21:19,444 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:21:19,444 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:21:19,444 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:21:19,445 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:21:19,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:21:19,445 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:21:19,445 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:21:19,445 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a0d4825ef04f5689aff4ed3e5df593fedd83b7eb3ae072cea52c48718c9baf42 [2023-02-15 22:21:19,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:21:19,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:21:19,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:21:19,814 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:21:19,814 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:21:19,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple-2.i [2023-02-15 22:21:20,998 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:21:21,291 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:21:21,292 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2023-02-15 22:21:21,311 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6886dcd/c191b4ed7d6049aa8db2ab85cbb29785/FLAG5ee1c4e7d [2023-02-15 22:21:21,330 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6886dcd/c191b4ed7d6049aa8db2ab85cbb29785 [2023-02-15 22:21:21,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:21:21,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:21:21,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:21,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:21:21,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:21:21,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3565c133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21, skipping insertion in model container [2023-02-15 22:21:21,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:21:21,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:21:21,687 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-02-15 22:21:21,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:21,704 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:21:21,746 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i[23225,23238] [2023-02-15 22:21:21,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:21:21,773 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:21:21,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21 WrapperNode [2023-02-15 22:21:21,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:21:21,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:21,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:21:21,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:21:21,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,837 INFO L138 Inliner]: procedures = 127, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-02-15 22:21:21,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:21:21,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:21:21,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:21:21,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:21:21,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,882 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:21:21,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:21:21,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:21:21,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:21:21,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (1/1) ... [2023-02-15 22:21:21,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:21:21,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:21,921 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) [2023-02-15 22:21:21,937 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 [2023-02-15 22:21:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 22:21:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 22:21:21,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 22:21:21,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:21:21,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:21:21,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:21:21,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:21:21,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 22:21:21,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:21:21,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:21:21,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:21:22,122 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:21:22,124 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:21:22,160 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 22:21:22,415 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:21:22,425 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:21:22,426 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:21:22,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:22 BoogieIcfgContainer [2023-02-15 22:21:22,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:21:22,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:21:22,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:21:22,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:21:22,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:21:21" (1/3) ... [2023-02-15 22:21:22,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74eece8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:22, skipping insertion in model container [2023-02-15 22:21:22,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:21" (2/3) ... [2023-02-15 22:21:22,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74eece8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:22, skipping insertion in model container [2023-02-15 22:21:22,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:22" (3/3) ... [2023-02-15 22:21:22,437 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-02-15 22:21:22,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:21:22,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 22:21:22,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:21:22,507 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b3d381, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:21:22,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 22:21:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.92) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:21:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:22,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:22,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:22,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516511, now seen corresponding path program 1 times [2023-02-15 22:21:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:22,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120679858] [2023-02-15 22:21:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:22,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:22,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:22,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:22,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:21:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:22,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:21:22,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:22,702 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:22,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:22,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120679858] [2023-02-15 22:21:22,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120679858] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:22,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605476520] [2023-02-15 22:21:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:22,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:22,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:22,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:22,808 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.92) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-02-15 22:21:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:23,054 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2023-02-15 22:21:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:23,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-02-15 22:21:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:23,063 INFO L225 Difference]: With dead ends: 74 [2023-02-15 22:21:23,063 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 22:21:23,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:23,069 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:23,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 22:21:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2023-02-15 22:21:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 49 states have internal predecessors, (61), 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) [2023-02-15 22:21:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2023-02-15 22:21:23,102 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 6 [2023-02-15 22:21:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:23,103 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2023-02-15 22:21:23,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-02-15 22:21:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2023-02-15 22:21:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:21:23,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:23,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:21:23,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:23,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516510, now seen corresponding path program 1 times [2023-02-15 22:21:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828115507] [2023-02-15 22:21:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:23,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:23,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:23,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:21:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:23,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:21:23,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:23,391 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:21:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:23,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:23,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:23,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828115507] [2023-02-15 22:21:23,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828115507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:23,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:23,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:21:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807503187] [2023-02-15 22:21:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:23,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:23,415 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-02-15 22:21:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:23,521 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-02-15 22:21:23,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:23,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-02-15 22:21:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:23,523 INFO L225 Difference]: With dead ends: 49 [2023-02-15 22:21:23,523 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 22:21:23,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:23,524 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:23,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 17 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 22:21:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2023-02-15 22:21:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 45 states have internal predecessors, (50), 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) [2023-02-15 22:21:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2023-02-15 22:21:23,529 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 6 [2023-02-15 22:21:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:23,530 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2023-02-15 22:21:23,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2023-02-15 22:21:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2023-02-15 22:21:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:21:23,531 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:23,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:23,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:23,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:23,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash 417959389, now seen corresponding path program 1 times [2023-02-15 22:21:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024225576] [2023-02-15 22:21:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:23,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:23,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:23,746 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:23,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:21:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:23,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:21:23,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:23,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:23,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:23,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024225576] [2023-02-15 22:21:23,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024225576] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:23,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:23,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:21:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264801279] [2023-02-15 22:21:23,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:23,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:21:23,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:23,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:21:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:21:23,882 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-02-15 22:21:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:24,012 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2023-02-15 22:21:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:21:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-02-15 22:21:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:24,014 INFO L225 Difference]: With dead ends: 51 [2023-02-15 22:21:24,014 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 22:21:24,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:21:24,015 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 58 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:24,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 35 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 22:21:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2023-02-15 22:21:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 45 states have internal predecessors, (49), 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) [2023-02-15 22:21:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2023-02-15 22:21:24,020 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2023-02-15 22:21:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:24,020 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2023-02-15 22:21:24,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-02-15 22:21:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2023-02-15 22:21:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:21:24,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:24,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:24,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:24,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:24,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash 71880067, now seen corresponding path program 1 times [2023-02-15 22:21:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:24,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272427671] [2023-02-15 22:21:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:24,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:24,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:24,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:21:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:24,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:21:24,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:24,353 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-15 22:21:24,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:21:24,413 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 22:21:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:24,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:24,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:24,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272427671] [2023-02-15 22:21:24,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272427671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:24,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:24,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:21:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308310204] [2023-02-15 22:21:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:24,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:21:24,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:24,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:21:24,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:21:24,425 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-02-15 22:21:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:24,678 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2023-02-15 22:21:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:21:24,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2023-02-15 22:21:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:24,679 INFO L225 Difference]: With dead ends: 82 [2023-02-15 22:21:24,679 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 22:21:24,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:21:24,681 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 67 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:24,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 22:21:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2023-02-15 22:21:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.394736842105263) internal successors, (53), 49 states have internal predecessors, (53), 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) [2023-02-15 22:21:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-15 22:21:24,686 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 12 [2023-02-15 22:21:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:24,687 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-15 22:21:24,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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) [2023-02-15 22:21:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-15 22:21:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:21:24,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:24,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:24,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:24,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:24,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769707, now seen corresponding path program 1 times [2023-02-15 22:21:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:24,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133378944] [2023-02-15 22:21:24,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:24,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:24,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:24,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:24,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:21:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:24,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:21:24,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:24,963 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:24,987 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:24,994 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:25,024 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:25,027 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:25,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:25,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:25,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133378944] [2023-02-15 22:21:25,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133378944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:25,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:25,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555592792] [2023-02-15 22:21:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:25,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:25,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:25,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:25,064 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2023-02-15 22:21:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:25,394 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-02-15 22:21:25,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:21:25,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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 [2023-02-15 22:21:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:25,395 INFO L225 Difference]: With dead ends: 60 [2023-02-15 22:21:25,396 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 22:21:25,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:21:25,397 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:25,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 22:21:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2023-02-15 22:21:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 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) [2023-02-15 22:21:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-15 22:21:25,400 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2023-02-15 22:21:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:25,400 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-15 22:21:25,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2023-02-15 22:21:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-15 22:21:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:21:25,401 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:25,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:25,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:25,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:25,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769708, now seen corresponding path program 1 times [2023-02-15 22:21:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:25,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485211941] [2023-02-15 22:21:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:25,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:25,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:25,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:25,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:21:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:25,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:21:25,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:25,679 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:21:25,694 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:25,710 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-02-15 22:21:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:25,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:25,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:25,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485211941] [2023-02-15 22:21:25,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485211941] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:25,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:25,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:21:25,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935933452] [2023-02-15 22:21:25,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:25,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:25,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:25,733 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2023-02-15 22:21:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:25,953 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-02-15 22:21:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:21:25,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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 [2023-02-15 22:21:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:25,954 INFO L225 Difference]: With dead ends: 54 [2023-02-15 22:21:25,954 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 22:21:25,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:21:25,955 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:25,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 85 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 22:21:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2023-02-15 22:21:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 37 states have internal predecessors, (41), 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) [2023-02-15 22:21:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-02-15 22:21:25,959 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 13 [2023-02-15 22:21:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:25,959 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-02-15 22:21:25,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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) [2023-02-15 22:21:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-02-15 22:21:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:21:25,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:25,960 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:25,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:26,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:26,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1804762195, now seen corresponding path program 1 times [2023-02-15 22:21:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:26,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047492088] [2023-02-15 22:21:26,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:26,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:26,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:26,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:26,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:21:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:26,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:21:26,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:26,265 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,271 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,327 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,330 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:26,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:26,403 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 21 [2023-02-15 22:21:26,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:26,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:26,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:21:26,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047492088] [2023-02-15 22:21:26,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047492088] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:26,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:21:26,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-15 22:21:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894644044] [2023-02-15 22:21:26,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:26,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:21:26,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:21:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:21:26,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:21:26,431 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2023-02-15 22:21:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:26,847 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2023-02-15 22:21:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:21:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 [2023-02-15 22:21:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:26,849 INFO L225 Difference]: With dead ends: 53 [2023-02-15 22:21:26,849 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 22:21:26,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:21:26,849 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:26,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 79 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:21:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 22:21:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2023-02-15 22:21:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 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) [2023-02-15 22:21:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-15 22:21:26,853 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2023-02-15 22:21:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:26,853 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-15 22:21:26,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2023-02-15 22:21:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-15 22:21:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:21:26,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:26,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:26,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:27,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:27,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-02-15 22:21:27,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash -113054509, now seen corresponding path program 1 times [2023-02-15 22:21:27,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:21:27,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42058606] [2023-02-15 22:21:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:27,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:27,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:21:27,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:21:27,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:21:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:27,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:21:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:21:27,167 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 22:21:27,168 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:21:27,169 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-02-15 22:21:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-15 22:21:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-15 22:21:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-02-15 22:21:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-02-15 22:21:27,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-02-15 22:21:27,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-02-15 22:21:27,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-02-15 22:21:27,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-02-15 22:21:27,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-15 22:21:27,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-15 22:21:27,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-02-15 22:21:27,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2023-02-15 22:21:27,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (2 of 16 remaining) [2023-02-15 22:21:27,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-15 22:21:27,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2023-02-15 22:21:27,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:27,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:21:27,386 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:27,389 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:21:27,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:21:27 BoogieIcfgContainer [2023-02-15 22:21:27,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:21:27,404 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:21:27,404 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:21:27,404 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:21:27,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:22" (3/4) ... [2023-02-15 22:21:27,407 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:21:27,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:21:27,407 INFO L158 Benchmark]: Toolchain (without parser) took 6074.36ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 41.1MB in the beginning and 49.5MB in the end (delta: -8.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 22:21:27,408 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 27.6MB in the beginning and 27.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:27,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.00ms. Allocated memory is still 65.0MB. Free memory was 40.9MB in the beginning and 38.6MB in the end (delta: 2.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:21:27,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.54ms. Allocated memory is still 65.0MB. Free memory was 38.6MB in the beginning and 36.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 22:21:27,409 INFO L158 Benchmark]: Boogie Preprocessor took 51.95ms. Allocated memory is still 65.0MB. Free memory was 36.6MB in the beginning and 34.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:27,409 INFO L158 Benchmark]: RCFGBuilder took 537.73ms. Allocated memory is still 65.0MB. Free memory was 34.9MB in the beginning and 34.3MB in the end (delta: 631.4kB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-02-15 22:21:27,409 INFO L158 Benchmark]: TraceAbstraction took 4972.40ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 33.8MB in the beginning and 50.3MB in the end (delta: -16.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-02-15 22:21:27,409 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 92.3MB. Free memory was 50.3MB in the beginning and 49.5MB in the end (delta: 759.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:21:27,411 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.16ms. Allocated memory is still 50.3MB. Free memory was 27.6MB in the beginning and 27.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.00ms. Allocated memory is still 65.0MB. Free memory was 40.9MB in the beginning and 38.6MB in the end (delta: 2.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.54ms. Allocated memory is still 65.0MB. Free memory was 38.6MB in the beginning and 36.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.95ms. Allocated memory is still 65.0MB. Free memory was 36.6MB in the beginning and 34.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 537.73ms. Allocated memory is still 65.0MB. Free memory was 34.9MB in the beginning and 34.3MB in the end (delta: 631.4kB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4972.40ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 33.8MB in the beginning and 50.3MB in the end (delta: -16.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 92.3MB. Free memory was 50.3MB in the beginning and 49.5MB in the end (delta: 759.8kB). 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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={6:0}] [L534] List t; [L535] List p = a; VAL [a={6:0}, p={6:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] p->h = 1 VAL [a={6:0}, p={6:0}] [L544] p->n = 0 VAL [a={6:0}, p={6:0}] [L545] p = a VAL [a={6:0}, p={6:0}] [L546] COND TRUE p!=0 VAL [a={6:0}, p={6:0}] [L547] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=1] [L547] COND FALSE !(p->h != 1) [L550] EXPR p->n VAL [a={6:0}, p={6:0}, p->n={0:0}] [L550] p = p->n [L546] COND FALSE !(p!=0) VAL [a={6:0}, p={0:0}] [L552] return 0; VAL [\result=0, a={6:0}, p={0: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: -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: 548]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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 2 procedures, 45 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 444 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 277 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 527 IncrementalHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 167 mSDtfsCounter, 527 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=1, InterpolantAutomatonStates: 43, 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, 7 MinimizatonAttempts, 102 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 31 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 4/6 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 [2023-02-15 22:21:27,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample