./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 a31fd051 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-?-a31fd05 [2023-02-15 13:20:31,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:20:31,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:20:31,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:20:31,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:20:31,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:20:31,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:20:31,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:20:31,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:20:31,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:20:31,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:20:31,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:20:31,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:20:31,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:20:31,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:20:31,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:20:31,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:20:31,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:20:31,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:20:31,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:20:31,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:20:31,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:20:31,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:20:31,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:20:31,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:20:31,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:20:31,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:20:31,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:20:31,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:20:31,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:20:31,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:20:31,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:20:31,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:20:31,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:20:31,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:20:31,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:20:31,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:20:31,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:20:31,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:20:31,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:20:31,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:20:31,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:20:31,180 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:20:31,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:20:31,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:20:31,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:20:31,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:20:31,182 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:20:31,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:20:31,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:20:31,182 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:20:31,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:20:31,183 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:20:31,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:20:31,184 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:20:31,185 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:20:31,185 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:20:31,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:20:31,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:20:31,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:20:31,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:20:31,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:20:31,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:20:31,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:20:31,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:20:31,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:20:31,186 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:20:31,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:20:31,187 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:20:31,187 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 13:20:31,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:20:31,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:20:31,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:20:31,383 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:20:31,384 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:20:31,385 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 13:20:32,321 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:20:32,540 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:20:32,545 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2023-02-15 13:20:32,555 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02981d4a6/650afecf3363463994cd9261925bd397/FLAGdc2ccf534 [2023-02-15 13:20:32,569 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02981d4a6/650afecf3363463994cd9261925bd397 [2023-02-15 13:20:32,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:20:32,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:20:32,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:20:32,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:20:32,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:20:32,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0d13f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32, skipping insertion in model container [2023-02-15 13:20:32,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:20:32,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:20:32,830 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 13:20:32,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:20:32,841 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:20:32,861 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 13:20:32,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:20:32,880 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:20:32,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32 WrapperNode [2023-02-15 13:20:32,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:20:32,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:20:32,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:20:32,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:20:32,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,921 INFO L138 Inliner]: procedures = 124, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-02-15 13:20:32,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:20:32,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:20:32,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:20:32,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:20:32,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,945 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:20:32,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:20:32,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:20:32,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:20:32,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (1/1) ... [2023-02-15 13:20:32,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:20:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:32,967 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 13:20:32,973 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 13:20:32,999 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 13:20:32,999 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:20:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:20:33,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:20:33,071 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:20:33,072 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:20:33,117 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 13:20:33,284 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:20:33,289 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:20:33,289 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:20:33,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:20:33 BoogieIcfgContainer [2023-02-15 13:20:33,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:20:33,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:20:33,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:20:33,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:20:33,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:20:32" (1/3) ... [2023-02-15 13:20:33,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed44a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:20:33, skipping insertion in model container [2023-02-15 13:20:33,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:32" (2/3) ... [2023-02-15 13:20:33,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed44a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:20:33, skipping insertion in model container [2023-02-15 13:20:33,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:20:33" (3/3) ... [2023-02-15 13:20:33,296 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-02-15 13:20:33,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:20:33,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 13:20:33,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:20:33,340 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;@196a2284, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:20:33,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 13:20:33,342 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 13:20:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:20:33,346 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:33,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:20:33,347 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 13:20:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517224, now seen corresponding path program 1 times [2023-02-15 13:20:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:33,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906904450] [2023-02-15 13:20:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:33,455 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 13:20:33,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:33,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906904450] [2023-02-15 13:20:33,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906904450] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:33,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:33,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:20:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426318163] [2023-02-15 13:20:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:33,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 13:20:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 13:20:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 13:20:33,507 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 13:20:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:33,518 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2023-02-15 13:20:33,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 13:20:33,520 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 13:20:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:33,523 INFO L225 Difference]: With dead ends: 45 [2023-02-15 13:20:33,524 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 13:20:33,525 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 13:20:33,527 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 13:20:33,527 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 13:20:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 13:20:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-15 13:20:33,544 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 13:20:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-02-15 13:20:33,546 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 6 [2023-02-15 13:20:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:33,546 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-02-15 13:20:33,546 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 13:20:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-02-15 13:20:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:20:33,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:33,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:33,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:20:33,548 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 13:20:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238120, now seen corresponding path program 1 times [2023-02-15 13:20:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015846663] [2023-02-15 13:20:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:33,664 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 13:20:33,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:33,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015846663] [2023-02-15 13:20:33,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015846663] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:33,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:33,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:20:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478045910] [2023-02-15 13:20:33,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:33,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:20:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:20:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:20:33,669 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 13:20:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:33,748 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2023-02-15 13:20:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:20:33,749 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 13:20:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:33,751 INFO L225 Difference]: With dead ends: 47 [2023-02-15 13:20:33,751 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 13:20:33,754 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 13:20:33,756 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 13:20:33,757 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 13:20:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 13:20:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2023-02-15 13:20:33,766 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 13:20:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-02-15 13:20:33,768 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 7 [2023-02-15 13:20:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:33,768 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-02-15 13:20:33,768 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 13:20:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-02-15 13:20:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 13:20:33,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:33,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:33,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:20:33,769 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 13:20:33,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238121, now seen corresponding path program 1 times [2023-02-15 13:20:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:33,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423144795] [2023-02-15 13:20:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:33,859 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 13:20:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:33,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423144795] [2023-02-15 13:20:33,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423144795] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:33,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:33,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:20:33,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269143035] [2023-02-15 13:20:33,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:33,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:20:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:33,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:20:33,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:20:33,861 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 13:20:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:33,944 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2023-02-15 13:20:33,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:20:33,945 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 13:20:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:33,946 INFO L225 Difference]: With dead ends: 56 [2023-02-15 13:20:33,946 INFO L226 Difference]: Without dead ends: 56 [2023-02-15 13:20:33,948 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 13:20:33,949 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 13:20:33,952 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 13:20:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-15 13:20:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-02-15 13:20:33,956 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 13:20:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-15 13:20:33,958 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2023-02-15 13:20:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:33,958 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-15 13:20:33,958 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 13:20:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-15 13:20:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:20:33,959 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:33,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:33,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:20:33,960 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 13:20:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:33,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1884133396, now seen corresponding path program 1 times [2023-02-15 13:20:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:33,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379771263] [2023-02-15 13:20:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:34,014 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 13:20:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:34,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379771263] [2023-02-15 13:20:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379771263] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:34,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:34,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:20:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33808997] [2023-02-15 13:20:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:34,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:20:34,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:20:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:20:34,017 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 13:20:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:34,052 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2023-02-15 13:20:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:20:34,053 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 13:20:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:34,053 INFO L225 Difference]: With dead ends: 53 [2023-02-15 13:20:34,053 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 13:20:34,053 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 13:20:34,054 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 13:20:34,054 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 13:20:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 13:20:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2023-02-15 13:20:34,057 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 13:20:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2023-02-15 13:20:34,058 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 12 [2023-02-15 13:20:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:34,058 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2023-02-15 13:20:34,058 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 13:20:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2023-02-15 13:20:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:20:34,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:34,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:34,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:20:34,059 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 13:20:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1721365971, now seen corresponding path program 1 times [2023-02-15 13:20:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532366872] [2023-02-15 13:20:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:34,203 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 13:20:34,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:34,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532366872] [2023-02-15 13:20:34,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532366872] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:34,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:34,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:20:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733711657] [2023-02-15 13:20:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:34,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:20:34,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:20:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:20:34,205 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 13:20:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:34,301 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2023-02-15 13:20:34,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:20:34,301 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 13:20:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:34,302 INFO L225 Difference]: With dead ends: 85 [2023-02-15 13:20:34,302 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 13:20:34,302 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 13:20:34,303 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 13:20:34,303 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 13:20:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 13:20:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2023-02-15 13:20:34,306 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 13:20:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2023-02-15 13:20:34,306 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 13 [2023-02-15 13:20:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:34,307 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-02-15 13:20:34,307 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 13:20:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2023-02-15 13:20:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:20:34,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:34,308 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:34,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:20:34,308 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 13:20:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash 761251611, now seen corresponding path program 1 times [2023-02-15 13:20:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:34,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944108994] [2023-02-15 13:20:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:34,426 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 13:20:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:34,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944108994] [2023-02-15 13:20:34,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944108994] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:34,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:34,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:20:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49609642] [2023-02-15 13:20:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:20:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:20:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:20:34,428 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 13:20:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:34,507 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-02-15 13:20:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:20:34,508 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 13:20:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:34,508 INFO L225 Difference]: With dead ends: 64 [2023-02-15 13:20:34,508 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 13:20:34,509 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 13:20:34,509 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 13:20:34,510 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 13:20:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 13:20:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2023-02-15 13:20:34,512 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 13:20:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-15 13:20:34,512 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2023-02-15 13:20:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:34,516 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-15 13:20:34,517 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 13:20:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-15 13:20:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:20:34,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:34,518 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:34,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:20:34,518 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 13:20:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash 761251612, now seen corresponding path program 1 times [2023-02-15 13:20:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:34,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556548241] [2023-02-15 13:20:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:34,663 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 13:20:34,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:34,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556548241] [2023-02-15 13:20:34,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556548241] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:34,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:34,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:20:34,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758802228] [2023-02-15 13:20:34,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:34,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:20:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:34,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:20:34,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:20:34,665 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 13:20:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:34,777 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-02-15 13:20:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:20:34,778 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 13:20:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:34,779 INFO L225 Difference]: With dead ends: 60 [2023-02-15 13:20:34,779 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 13:20:34,780 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 13:20:34,782 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 13:20:34,782 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 13:20:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 13:20:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2023-02-15 13:20:34,788 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 13:20:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-15 13:20:34,789 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2023-02-15 13:20:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-15 13:20:34,790 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 13:20:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-15 13:20:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:20:34,790 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:34,790 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:34,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:20:34,791 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 13:20:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash 700715683, now seen corresponding path program 1 times [2023-02-15 13:20:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:34,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686248732] [2023-02-15 13:20:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:34,954 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 13:20:34,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:20:34,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686248732] [2023-02-15 13:20:34,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686248732] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:20:34,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676661762] [2023-02-15 13:20:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:34,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:20:34,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:34,969 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 13:20:35,000 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 13:20:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:35,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:20:35,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:35,122 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 13:20:35,126 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 13:20:35,193 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 13:20:35,196 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 13:20:35,204 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 13:20:35,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:35,324 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 13:20:35,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:35,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:35,428 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 13:20:35,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676661762] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:35,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:20:35,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2023-02-15 13:20:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5345570] [2023-02-15 13:20:35,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:35,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:20:35,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:20:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:20:35,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:20:35,430 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 13:20:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:35,602 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2023-02-15 13:20:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:20:35,603 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 13:20:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:35,603 INFO L225 Difference]: With dead ends: 55 [2023-02-15 13:20:35,603 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 13:20:35,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:20:35,604 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 13:20:35,604 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 13:20:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 13:20:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2023-02-15 13:20:35,606 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 13:20:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-02-15 13:20:35,606 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 16 [2023-02-15 13:20:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:35,607 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-02-15 13:20:35,607 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 13:20:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-02-15 13:20:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:20:35,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:35,607 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 13:20:35,619 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 13:20:35,812 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 13:20:35,813 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 13:20:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash 247348413, now seen corresponding path program 1 times [2023-02-15 13:20:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:20:35,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461609371] [2023-02-15 13:20:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:20:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:20:35,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:20:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:20:35,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:20:35,835 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:20:35,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-02-15 13:20:35,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-15 13:20:35,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-15 13:20:35,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-15 13:20:35,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-02-15 13:20:35,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2023-02-15 13:20:35,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (2 of 16 remaining) [2023-02-15 13:20:35,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-15 13:20:35,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2023-02-15 13:20:35,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:20:35,841 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:35,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:20:35,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:20:35 BoogieIcfgContainer [2023-02-15 13:20:35,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:20:35,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:20:35,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:20:35,856 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:20:35,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:20:33" (3/4) ... [2023-02-15 13:20:35,858 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:20:35,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:20:35,858 INFO L158 Benchmark]: Toolchain (without parser) took 3286.26ms. Allocated memory was 134.2MB in the beginning and 211.8MB in the end (delta: 77.6MB). Free memory was 100.5MB in the beginning and 124.3MB in the end (delta: -23.8MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2023-02-15 13:20:35,858 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:20:35,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.48ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 83.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 13:20:35,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.80ms. Allocated memory is still 134.2MB. Free memory was 83.7MB in the beginning and 82.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:20:35,859 INFO L158 Benchmark]: Boogie Preprocessor took 23.39ms. Allocated memory is still 134.2MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:20:35,859 INFO L158 Benchmark]: RCFGBuilder took 343.31ms. Allocated memory is still 134.2MB. Free memory was 80.4MB in the beginning and 66.6MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 13:20:35,860 INFO L158 Benchmark]: TraceAbstraction took 2563.12ms. Allocated memory was 134.2MB in the beginning and 211.8MB in the end (delta: 77.6MB). Free memory was 66.1MB in the beginning and 124.3MB in the end (delta: -58.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2023-02-15 13:20:35,860 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 211.8MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:20:35,861 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 111.1MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.48ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 83.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.80ms. Allocated memory is still 134.2MB. Free memory was 83.7MB in the beginning and 82.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.39ms. Allocated memory is still 134.2MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.31ms. Allocated memory is still 134.2MB. Free memory was 80.4MB in the beginning and 66.6MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2563.12ms. Allocated memory was 134.2MB in the beginning and 211.8MB in the end (delta: 77.6MB). Free memory was 66.1MB in the beginning and 124.3MB in the end (delta: -58.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 211.8MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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: 2.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.3s 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.4s 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 1 QuantifiedInterpolants, 879 SizeOfPredicates, 12 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 13:20:35,883 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-?-a31fd05 [2023-02-15 13:20:37,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:20:37,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:20:37,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:20:37,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:20:37,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:20:37,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:20:37,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:20:37,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:20:37,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:20:37,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:20:37,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:20:37,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:20:37,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:20:37,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:20:37,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:20:37,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:20:37,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:20:37,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:20:37,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:20:37,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:20:37,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:20:37,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:20:37,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:20:37,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:20:37,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:20:37,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:20:37,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:20:37,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:20:37,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:20:37,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:20:37,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:20:37,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:20:37,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:20:37,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:20:37,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:20:37,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:20:37,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:20:37,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:20:37,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:20:37,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:20:37,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 13:20:37,748 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:20:37,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:20:37,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:20:37,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:20:37,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:20:37,751 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:20:37,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:20:37,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:20:37,751 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:20:37,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:20:37,752 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:20:37,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:20:37,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:20:37,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:20:37,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:20:37,753 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:20:37,753 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:20:37,753 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:20:37,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:20:37,753 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:20:37,754 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:20:37,754 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:20:37,754 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:20:37,754 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:20:37,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:20:37,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:20:37,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:20:37,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:20:37,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:20:37,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:20:37,755 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:20:37,755 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:20:37,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:20:37,756 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:20:37,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:20:37,756 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:20:37,756 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:20:37,756 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 13:20:38,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:20:38,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:20:38,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:20:38,029 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:20:38,030 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:20:38,031 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 13:20:39,050 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:20:39,235 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:20:39,235 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple-2.i [2023-02-15 13:20:39,245 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca94fd2/3837f1290474496f9a1bbeed10d55f4e/FLAG90c97e78f [2023-02-15 13:20:39,257 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ca94fd2/3837f1290474496f9a1bbeed10d55f4e [2023-02-15 13:20:39,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:20:39,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:20:39,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:20:39,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:20:39,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:20:39,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e3536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39, skipping insertion in model container [2023-02-15 13:20:39,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:20:39,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:20:39,488 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 13:20:39,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:20:39,502 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:20:39,540 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 13:20:39,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:20:39,566 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:20:39,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39 WrapperNode [2023-02-15 13:20:39,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:20:39,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:20:39,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:20:39,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:20:39,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,627 INFO L138 Inliner]: procedures = 127, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-02-15 13:20:39,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:20:39,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:20:39,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:20:39,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:20:39,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,666 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:20:39,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:20:39,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:20:39,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:20:39,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (1/1) ... [2023-02-15 13:20:39,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:20:39,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:20:39,718 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 13:20:39,753 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 13:20:39,768 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 13:20:39,769 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 13:20:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 13:20:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:20:39,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:20:39,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:20:39,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:20:39,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 13:20:39,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 13:20:39,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:20:39,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:20:39,904 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:20:39,905 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:20:39,937 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 13:20:40,069 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:20:40,073 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:20:40,074 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:20:40,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:20:40 BoogieIcfgContainer [2023-02-15 13:20:40,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:20:40,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:20:40,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:20:40,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:20:40,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:20:39" (1/3) ... [2023-02-15 13:20:40,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1627bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:20:40, skipping insertion in model container [2023-02-15 13:20:40,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:20:39" (2/3) ... [2023-02-15 13:20:40,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1627bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:20:40, skipping insertion in model container [2023-02-15 13:20:40,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:20:40" (3/3) ... [2023-02-15 13:20:40,080 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-2.i [2023-02-15 13:20:40,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:20:40,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 13:20:40,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:20:40,123 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;@267c3be2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:20:40,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 13:20:40,126 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 13:20:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:20:40,130 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:40,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:20:40,130 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 13:20:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516511, now seen corresponding path program 1 times [2023-02-15 13:20:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:40,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614009] [2023-02-15 13:20:40,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:40,142 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 13:20:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:40,144 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 13:20:40,176 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 13:20:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:40,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:20:40,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:40,283 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 13:20:40,337 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 13:20:40,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:20:40,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:20:40,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614009] [2023-02-15 13:20:40,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614009] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:40,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:40,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:20:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774884528] [2023-02-15 13:20:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:40,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:20:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:20:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:20:40,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:20:40,372 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 13:20:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:40,542 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2023-02-15 13:20:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:20:40,544 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 13:20:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:40,548 INFO L225 Difference]: With dead ends: 74 [2023-02-15 13:20:40,548 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 13:20:40,550 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 13:20:40,553 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:40,554 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.1s Time] [2023-02-15 13:20:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 13:20:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2023-02-15 13:20:40,575 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 13:20:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2023-02-15 13:20:40,578 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 6 [2023-02-15 13:20:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:40,579 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2023-02-15 13:20:40,579 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 13:20:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2023-02-15 13:20:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:20:40,580 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:40,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:20:40,586 INFO L552 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)] Ended with exit code 0 [2023-02-15 13:20:40,786 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 13:20:40,787 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 13:20:40,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516510, now seen corresponding path program 1 times [2023-02-15 13:20:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:40,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592600744] [2023-02-15 13:20:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:40,788 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 13:20:40,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:40,790 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 13:20:40,791 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 13:20:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:40,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:20:40,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:40,871 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 13:20:40,883 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 13:20:40,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:20:40,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:20:40,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592600744] [2023-02-15 13:20:40,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592600744] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:40,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:40,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:20:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709560947] [2023-02-15 13:20:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:40,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:20:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:20:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:20:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:20:40,886 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 13:20:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:40,987 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2023-02-15 13:20:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:20:40,988 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 13:20:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:40,989 INFO L225 Difference]: With dead ends: 49 [2023-02-15 13:20:40,989 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 13:20:40,989 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 13:20:40,990 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 13:20:40,990 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 13:20:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 13:20:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2023-02-15 13:20:40,992 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 13:20:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2023-02-15 13:20:40,993 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 6 [2023-02-15 13:20:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:40,993 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2023-02-15 13:20:40,993 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 13:20:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2023-02-15 13:20:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 13:20:40,994 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:40,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:41,002 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 13:20:41,200 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 13:20:41,201 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 13:20:41,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash 417959389, now seen corresponding path program 1 times [2023-02-15 13:20:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:41,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299925443] [2023-02-15 13:20:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:41,202 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 13:20:41,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:41,203 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 13:20:41,205 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 13:20:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:41,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:20:41,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:41,262 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 13:20:41,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:20:41,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:20:41,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299925443] [2023-02-15 13:20:41,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299925443] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:41,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:41,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:20:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069059109] [2023-02-15 13:20:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:41,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:20:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:20:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:20:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:20:41,264 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 13:20:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:41,340 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2023-02-15 13:20:41,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:20:41,341 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 13:20:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:41,342 INFO L225 Difference]: With dead ends: 51 [2023-02-15 13:20:41,342 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 13:20:41,342 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 13:20:41,343 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 13:20:41,343 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 13:20:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 13:20:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2023-02-15 13:20:41,346 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 13:20:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2023-02-15 13:20:41,346 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2023-02-15 13:20:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:41,346 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2023-02-15 13:20:41,347 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 13:20:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2023-02-15 13:20:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:20:41,347 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:41,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:41,356 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 13:20:41,547 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 13:20:41,548 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 13:20:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:41,548 INFO L85 PathProgramCache]: Analyzing trace with hash 71880067, now seen corresponding path program 1 times [2023-02-15 13:20:41,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:41,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731085471] [2023-02-15 13:20:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:41,549 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 13:20:41,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:41,551 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 13:20:41,558 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 13:20:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:41,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:20:41,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:41,658 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 13:20:41,682 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 13:20:41,700 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 13:20:41,706 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 13:20:41,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:20:41,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:20:41,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731085471] [2023-02-15 13:20:41,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731085471] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:41,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:41,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:20:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854859277] [2023-02-15 13:20:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:41,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:20:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:20:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:20:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:20:41,709 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 13:20:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:41,905 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2023-02-15 13:20:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:20:41,905 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 13:20:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:41,906 INFO L225 Difference]: With dead ends: 82 [2023-02-15 13:20:41,906 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 13:20:41,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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 13:20:41,907 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 67 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 13:20:41,907 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 13:20:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 13:20:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 50. [2023-02-15 13:20:41,910 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 13:20:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-15 13:20:41,911 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 12 [2023-02-15 13:20:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:41,911 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-15 13:20:41,911 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 13:20:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-15 13:20:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:20:41,911 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:41,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:41,920 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 13:20:42,120 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 13:20:42,120 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 13:20:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769707, now seen corresponding path program 1 times [2023-02-15 13:20:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:42,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670754680] [2023-02-15 13:20:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:42,121 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 13:20:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:42,125 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 13:20:42,128 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 13:20:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:42,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:20:42,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:42,202 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 13:20:42,227 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 13:20:42,232 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 13:20:42,251 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 13:20:42,256 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 13:20:42,280 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 13:20:42,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:20:42,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:20:42,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670754680] [2023-02-15 13:20:42,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670754680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:42,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:42,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:20:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700656129] [2023-02-15 13:20:42,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:42,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:20:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:20:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:20:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:20:42,283 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 13:20:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:42,549 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-02-15 13:20:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:20:42,549 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 13:20:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:42,550 INFO L225 Difference]: With dead ends: 60 [2023-02-15 13:20:42,550 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 13:20:42,550 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 13:20:42,550 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 13:20:42,551 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 13:20:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 13:20:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2023-02-15 13:20:42,553 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 13:20:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-15 13:20:42,553 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2023-02-15 13:20:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:42,554 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-15 13:20:42,554 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 13:20:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-15 13:20:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:20:42,554 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:42,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:42,563 INFO L552 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)] Ended with exit code 0 [2023-02-15 13:20:42,754 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 13:20:42,755 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 13:20:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769708, now seen corresponding path program 1 times [2023-02-15 13:20:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:42,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613824224] [2023-02-15 13:20:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:42,756 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 13:20:42,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:42,757 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 13:20:42,759 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 13:20:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:42,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:20:42,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:42,811 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 13:20:42,827 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 13:20:42,843 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 13:20:42,870 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 13:20:42,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:20:42,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:20:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613824224] [2023-02-15 13:20:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613824224] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:20:42,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:20:42,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:20:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494227612] [2023-02-15 13:20:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:20:42,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:20:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:20:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:20:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:20:42,873 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 13:20:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:43,032 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-02-15 13:20:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:20:43,033 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 13:20:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:43,033 INFO L225 Difference]: With dead ends: 54 [2023-02-15 13:20:43,033 INFO L226 Difference]: Without dead ends: 54 [2023-02-15 13:20:43,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 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 13:20:43,034 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:43,034 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.1s Time] [2023-02-15 13:20:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-15 13:20:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2023-02-15 13:20:43,036 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 13:20:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-02-15 13:20:43,037 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 13 [2023-02-15 13:20:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:43,037 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-02-15 13:20:43,037 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 13:20:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-02-15 13:20:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:20:43,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:43,037 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:43,046 INFO L552 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)] Ended with exit code 0 [2023-02-15 13:20:43,238 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 13:20:43,238 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 13:20:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1804762195, now seen corresponding path program 1 times [2023-02-15 13:20:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:43,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835639283] [2023-02-15 13:20:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:43,239 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 13:20:43,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:43,244 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 13:20:43,246 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 13:20:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:20:43,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:20:43,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:20:43,338 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 13:20:43,343 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 13:20:43,390 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 13:20:43,394 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 13:20:43,417 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 13:20:43,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:20:43,447 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 13:20:43,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:43,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:20:43,484 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 13:20:43,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:20:43,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835639283] [2023-02-15 13:20:43,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835639283] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:20:43,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:20:43,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-15 13:20:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476609294] [2023-02-15 13:20:43,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:20:43,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:20:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:20:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:20:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:20:43,486 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 13:20:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:20:46,025 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2023-02-15 13:20:46,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:20:46,026 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 13:20:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:20:46,026 INFO L225 Difference]: With dead ends: 53 [2023-02-15 13:20:46,027 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 13:20:46,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:20:46,027 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:20:46,027 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.4s Time] [2023-02-15 13:20:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 13:20:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2023-02-15 13:20:46,029 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 13:20:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-02-15 13:20:46,030 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2023-02-15 13:20:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:20:46,030 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-02-15 13:20:46,030 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 13:20:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-02-15 13:20:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:20:46,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:20:46,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:46,041 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 13:20:46,231 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 13:20:46,231 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 13:20:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:20:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash -113054509, now seen corresponding path program 1 times [2023-02-15 13:20:46,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:20:46,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882561390] [2023-02-15 13:20:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:20:46,232 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 13:20:46,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:20:46,233 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 13:20:46,235 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 13:20:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:20:46,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:20:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:20:46,325 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 13:20:46,326 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:20:46,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-02-15 13:20:46,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-02-15 13:20:46,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-02-15 13:20:46,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2023-02-15 13:20:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (2 of 16 remaining) [2023-02-15 13:20:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-02-15 13:20:46,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2023-02-15 13:20:46,339 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 13:20:46,529 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 13:20:46,532 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:20:46,534 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:20:46,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:20:46 BoogieIcfgContainer [2023-02-15 13:20:46,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:20:46,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:20:46,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:20:46,561 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:20:46,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:20:40" (3/4) ... [2023-02-15 13:20:46,563 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:20:46,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:20:46,564 INFO L158 Benchmark]: Toolchain (without parser) took 7304.55ms. Allocated memory was 71.3MB in the beginning and 140.5MB in the end (delta: 69.2MB). Free memory was 46.6MB in the beginning and 116.2MB in the end (delta: -69.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:20:46,564 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 71.3MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:20:46,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.19ms. Allocated memory is still 71.3MB. Free memory was 46.4MB in the beginning and 28.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 13:20:46,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.42ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 28.3MB in the beginning and 91.4MB in the end (delta: -63.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2023-02-15 13:20:46,583 INFO L158 Benchmark]: Boogie Preprocessor took 47.57ms. Allocated memory is still 113.2MB. Free memory was 91.4MB in the beginning and 89.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:20:46,583 INFO L158 Benchmark]: RCFGBuilder took 398.67ms. Allocated memory is still 113.2MB. Free memory was 89.6MB in the beginning and 73.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 13:20:46,584 INFO L158 Benchmark]: TraceAbstraction took 6483.76ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 73.4MB in the beginning and 117.1MB in the end (delta: -43.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:20:46,584 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 140.5MB. Free memory was 117.1MB in the beginning and 116.2MB in the end (delta: 889.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:20:46,587 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 71.3MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.19ms. Allocated memory is still 71.3MB. Free memory was 46.4MB in the beginning and 28.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.42ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 28.3MB in the beginning and 91.4MB in the end (delta: -63.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.57ms. Allocated memory is still 113.2MB. Free memory was 91.4MB in the beginning and 89.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.67ms. Allocated memory is still 113.2MB. Free memory was 89.6MB in the beginning and 73.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6483.76ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 73.4MB in the beginning and 117.1MB in the end (delta: -43.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 140.5MB. Free memory was 117.1MB in the beginning and 116.2MB in the end (delta: 889.4kB). 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: 6.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 444 SdHoareTripleChecker+Invalid, 1.0s 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, 61 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.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.6s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 33 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 13:20:46,611 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