./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e 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-ext-properties/960521-1_1-3.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 b78007c6b6ea6b815e47bde6b36f25c26c431b61fea97b83eeeefa52c8c4206a --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:24:44,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:24:44,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:24:45,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:24:45,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:24:45,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:24:45,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:24:45,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:24:45,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:24:45,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:24:45,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:24:45,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:24:45,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:24:45,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:24:45,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:24:45,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:24:45,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:24:45,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:24:45,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:24:45,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:24:45,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:24:45,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:24:45,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:24:45,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:24:45,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:24:45,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:24:45,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:24:45,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:24:45,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:24:45,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:24:45,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:24:45,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:24:45,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:24:45,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:24:45,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:24:45,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:24:45,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:24:45,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:24:45,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:24:45,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:24:45,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:24:45,070 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:24:45,091 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:24:45,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:24:45,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:24:45,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:24:45,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:24:45,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:24:45,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:24:45,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:24:45,097 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:24:45,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:24:45,098 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:24:45,098 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:24:45,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:24:45,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:24:45,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:24:45,099 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:24:45,099 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:24:45,099 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:24:45,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:24:45,099 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:24:45,099 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:24:45,100 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:24:45,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:24:45,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:24:45,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:24:45,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:45,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:24:45,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:24:45,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:24:45,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:24:45,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:24:45,101 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:24:45,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:24:45,102 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:24:45,102 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 -> b78007c6b6ea6b815e47bde6b36f25c26c431b61fea97b83eeeefa52c8c4206a [2023-02-17 08:24:45,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:24:45,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:24:45,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:24:45,281 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:24:45,281 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:24:45,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2023-02-17 08:24:46,204 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:24:46,345 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:24:46,346 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-3.i [2023-02-17 08:24:46,353 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a2c8186/1d31a0e05ee249eea71455ec4351050a/FLAGbb21ab992 [2023-02-17 08:24:46,362 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a2c8186/1d31a0e05ee249eea71455ec4351050a [2023-02-17 08:24:46,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:24:46,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:24:46,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:46,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:24:46,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:24:46,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@675ea0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46, skipping insertion in model container [2023-02-17 08:24:46,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:24:46,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:24:46,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:46,639 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:24:46,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:24:46,689 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:24:46,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46 WrapperNode [2023-02-17 08:24:46,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:24:46,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:24:46,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:24:46,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:24:46,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,725 INFO L138 Inliner]: procedures = 122, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2023-02-17 08:24:46,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:24:46,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:24:46,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:24:46,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:24:46,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,744 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:24:46,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:24:46,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:24:46,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:24:46,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (1/1) ... [2023-02-17 08:24:46,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:24:46,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:46,781 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-17 08:24:46,790 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-17 08:24:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 08:24:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 08:24:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:24:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:24:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:24:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 08:24:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:24:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:24:46,879 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:24:46,880 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:24:47,043 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:24:47,047 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:24:47,047 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-17 08:24:47,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:24:47 BoogieIcfgContainer [2023-02-17 08:24:47,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:24:47,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:24:47,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:24:47,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:24:47,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:24:46" (1/3) ... [2023-02-17 08:24:47,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fd209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:24:47, skipping insertion in model container [2023-02-17 08:24:47,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:24:46" (2/3) ... [2023-02-17 08:24:47,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fd209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:24:47, skipping insertion in model container [2023-02-17 08:24:47,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:24:47" (3/3) ... [2023-02-17 08:24:47,054 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1-3.i [2023-02-17 08:24:47,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:24:47,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2023-02-17 08:24:47,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:24:47,096 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;@4da6285e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:24:47,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-02-17 08:24:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.875) internal successors, (60), 53 states have internal predecessors, (60), 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-17 08:24:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-17 08:24:47,112 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:47,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-17 08:24:47,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 28702701, now seen corresponding path program 1 times [2023-02-17 08:24:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:47,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868368389] [2023-02-17 08:24:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:47,234 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-17 08:24:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:47,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868368389] [2023-02-17 08:24:47,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868368389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:47,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:47,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:47,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336097230] [2023-02-17 08:24:47,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:47,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 08:24:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 08:24:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 08:24:47,269 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.875) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:47,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:47,283 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2023-02-17 08:24:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 08:24:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-17 08:24:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:47,290 INFO L225 Difference]: With dead ends: 54 [2023-02-17 08:24:47,291 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 08:24:47,292 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-17 08:24:47,296 INFO L413 NwaCegarLoop]: 57 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, 57 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-17 08:24:47,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 08:24:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-17 08:24:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.7741935483870968) 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-17 08:24:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2023-02-17 08:24:47,322 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 5 [2023-02-17 08:24:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:47,322 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2023-02-17 08:24:47,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2023-02-17 08:24:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:24:47,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:47,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:24:47,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 08:24:47,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 889569384, now seen corresponding path program 1 times [2023-02-17 08:24:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144716182] [2023-02-17 08:24:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:47,456 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-17 08:24:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:47,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144716182] [2023-02-17 08:24:47,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144716182] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:47,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:47,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517708247] [2023-02-17 08:24:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:47,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:47,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:47,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:47,459 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-17 08:24:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:47,489 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2023-02-17 08:24:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:47,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-17 08:24:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:47,490 INFO L225 Difference]: With dead ends: 51 [2023-02-17 08:24:47,491 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 08:24:47,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:47,492 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:47,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 08:24:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 08:24:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 50 states have internal predecessors, (54), 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-17 08:24:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2023-02-17 08:24:47,496 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 6 [2023-02-17 08:24:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:47,496 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2023-02-17 08:24:47,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-17 08:24:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2023-02-17 08:24:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:24:47,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:47,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:24:47,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 08:24:47,498 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:47,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash 889569385, now seen corresponding path program 1 times [2023-02-17 08:24:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:47,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151952545] [2023-02-17 08:24:47,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:47,569 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-17 08:24:47,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:47,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151952545] [2023-02-17 08:24:47,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151952545] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:47,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:47,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:47,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611576242] [2023-02-17 08:24:47,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:47,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:47,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:47,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:47,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:47,572 INFO L87 Difference]: Start difference. First operand 51 states and 54 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-17 08:24:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:47,614 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2023-02-17 08:24:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:24:47,616 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-17 08:24:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:47,616 INFO L225 Difference]: With dead ends: 99 [2023-02-17 08:24:47,617 INFO L226 Difference]: Without dead ends: 99 [2023-02-17 08:24:47,617 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-17 08:24:47,618 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:47,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-17 08:24:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 55. [2023-02-17 08:24:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 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-17 08:24:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-17 08:24:47,623 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2023-02-17 08:24:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:47,623 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-17 08:24:47,623 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-17 08:24:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-17 08:24:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 08:24:47,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:47,624 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:47,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 08:24:47,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash 179257870, now seen corresponding path program 1 times [2023-02-17 08:24:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:47,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866132444] [2023-02-17 08:24:47,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:47,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:47,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866132444] [2023-02-17 08:24:47,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866132444] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:47,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347982638] [2023-02-17 08:24:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:47,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:47,691 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-17 08:24:47,692 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-17 08:24:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:47,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:24:47,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:47,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:47,828 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 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:24:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:47,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:47,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347982638] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:47,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:24:47,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-02-17 08:24:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489873859] [2023-02-17 08:24:47,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:47,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 08:24:47,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:47,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 08:24:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:24:47,879 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-17 08:24:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:47,993 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2023-02-17 08:24:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:24:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 08:24:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:47,997 INFO L225 Difference]: With dead ends: 146 [2023-02-17 08:24:47,998 INFO L226 Difference]: Without dead ends: 146 [2023-02-17 08:24:47,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:24:48,001 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 344 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:48,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 289 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:24:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-17 08:24:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 50. [2023-02-17 08:24:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) 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-17 08:24:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2023-02-17 08:24:48,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 8 [2023-02-17 08:24:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:48,013 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2023-02-17 08:24:48,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-17 08:24:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2023-02-17 08:24:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 08:24:48,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:48,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:48,021 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-17 08:24:48,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:48,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:48,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:48,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292751, now seen corresponding path program 1 times [2023-02-17 08:24:48,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:48,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366491132] [2023-02-17 08:24:48,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:48,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:48,295 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-17 08:24:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:48,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366491132] [2023-02-17 08:24:48,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366491132] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:48,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:48,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533535146] [2023-02-17 08:24:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:48,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:48,301 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-17 08:24:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:48,324 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2023-02-17 08:24:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:48,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-02-17 08:24:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:48,325 INFO L225 Difference]: With dead ends: 47 [2023-02-17 08:24:48,326 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 08:24:48,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:48,329 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:48,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 49 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 08:24:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-17 08:24:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 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-17 08:24:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2023-02-17 08:24:48,337 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2023-02-17 08:24:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:48,337 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2023-02-17 08:24:48,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-17 08:24:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2023-02-17 08:24:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 08:24:48,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:48,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:48,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 08:24:48,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292752, now seen corresponding path program 1 times [2023-02-17 08:24:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:48,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434053951] [2023-02-17 08:24:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:48,409 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-17 08:24:48,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:48,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434053951] [2023-02-17 08:24:48,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434053951] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:48,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:48,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:24:48,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994865871] [2023-02-17 08:24:48,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:48,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:24:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:24:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:48,411 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-17 08:24:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:48,486 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-02-17 08:24:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:24:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2023-02-17 08:24:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:48,487 INFO L225 Difference]: With dead ends: 82 [2023-02-17 08:24:48,487 INFO L226 Difference]: Without dead ends: 82 [2023-02-17 08:24:48,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:24:48,489 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 151 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:48,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 72 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:24:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-17 08:24:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 47. [2023-02-17 08:24:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 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-17 08:24:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-02-17 08:24:48,499 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 9 [2023-02-17 08:24:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:48,499 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-02-17 08:24:48,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-17 08:24:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-02-17 08:24:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 08:24:48,499 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:48,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:48,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 08:24:48,500 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2038145083, now seen corresponding path program 1 times [2023-02-17 08:24:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:48,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340659578] [2023-02-17 08:24:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:48,534 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-17 08:24:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340659578] [2023-02-17 08:24:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340659578] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:48,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:48,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792488352] [2023-02-17 08:24:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:48,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:48,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:48,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:48,537 INFO L87 Difference]: Start difference. First operand 47 states and 51 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-17 08:24:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:48,566 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2023-02-17 08:24:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:24:48,566 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-17 08:24:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:48,567 INFO L225 Difference]: With dead ends: 89 [2023-02-17 08:24:48,567 INFO L226 Difference]: Without dead ends: 89 [2023-02-17 08:24:48,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:48,568 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 37 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:48,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 141 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-17 08:24:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2023-02-17 08:24:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 58 states have internal predecessors, (66), 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-17 08:24:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-17 08:24:48,575 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 11 [2023-02-17 08:24:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:48,575 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-17 08:24:48,575 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-17 08:24:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-17 08:24:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:24:48,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:48,576 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:48,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 08:24:48,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1240415274, now seen corresponding path program 1 times [2023-02-17 08:24:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:48,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882503569] [2023-02-17 08:24:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:48,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:48,620 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-17 08:24:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:48,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882503569] [2023-02-17 08:24:48,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882503569] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:48,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446625582] [2023-02-17 08:24:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:48,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:48,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:48,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:24:48,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 08:24:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:48,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:24:48,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:48,697 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-17 08:24:48,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:48,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446625582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:48,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:24:48,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-02-17 08:24:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651680016] [2023-02-17 08:24:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:48,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:24:48,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:24:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:48,702 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-17 08:24:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:48,726 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2023-02-17 08:24:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-17 08:24:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:48,727 INFO L225 Difference]: With dead ends: 86 [2023-02-17 08:24:48,727 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 08:24:48,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:24:48,728 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 31 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:48,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 169 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 08:24:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2023-02-17 08:24:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 57 states have internal predecessors, (63), 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-17 08:24:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2023-02-17 08:24:48,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 12 [2023-02-17 08:24:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:48,737 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2023-02-17 08:24:48,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-17 08:24:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2023-02-17 08:24:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:24:48,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:48,738 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:48,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:48,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-17 08:24:48,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:48,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2776502, now seen corresponding path program 1 times [2023-02-17 08:24:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:48,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323056594] [2023-02-17 08:24:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:48,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:48,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323056594] [2023-02-17 08:24:48,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323056594] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:48,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687127400] [2023-02-17 08:24:48,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:48,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:48,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:48,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:24:48,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 08:24:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:49,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:24:49,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:49,036 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-17 08:24:49,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:24:49,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687127400] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:49,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:24:49,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-02-17 08:24:49,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848854773] [2023-02-17 08:24:49,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:49,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:24:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:24:49,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:24:49,038 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-17 08:24:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:49,063 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2023-02-17 08:24:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-17 08:24:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:49,064 INFO L225 Difference]: With dead ends: 92 [2023-02-17 08:24:49,064 INFO L226 Difference]: Without dead ends: 92 [2023-02-17 08:24:49,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:24:49,066 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 103 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:49,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 135 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-17 08:24:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 59. [2023-02-17 08:24:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 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-17 08:24:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-02-17 08:24:49,067 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2023-02-17 08:24:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:49,068 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-02-17 08:24:49,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-17 08:24:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-02-17 08:24:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 08:24:49,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:49,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:49,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:49,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:49,283 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash 87668155, now seen corresponding path program 1 times [2023-02-17 08:24:49,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:49,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138365425] [2023-02-17 08:24:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:49,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138365425] [2023-02-17 08:24:49,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138365425] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:49,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878206462] [2023-02-17 08:24:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:49,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:49,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:49,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:24:49,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 08:24:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:49,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 08:24:49,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:49,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:49,429 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 1 case distinctions, treesize of input 13 treesize of output 31 [2023-02-17 08:24:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:49,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:49,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878206462] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:49,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:24:49,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2023-02-17 08:24:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335458581] [2023-02-17 08:24:49,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:49,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 08:24:49,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 08:24:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-02-17 08:24:49,563 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:49,891 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2023-02-17 08:24:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 08:24:49,891 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-17 08:24:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:49,892 INFO L225 Difference]: With dead ends: 145 [2023-02-17 08:24:49,892 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 08:24:49,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2023-02-17 08:24:49,892 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 405 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:49,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 406 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:24:49,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 08:24:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2023-02-17 08:24:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.353846153846154) internal successors, (88), 78 states have internal predecessors, (88), 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-17 08:24:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2023-02-17 08:24:49,895 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2023-02-17 08:24:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:49,895 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2023-02-17 08:24:49,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:24:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2023-02-17 08:24:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 08:24:49,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:49,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:49,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:50,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:50,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:50,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash 685561807, now seen corresponding path program 1 times [2023-02-17 08:24:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:50,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318473831] [2023-02-17 08:24:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:24:50,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:50,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318473831] [2023-02-17 08:24:50,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318473831] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:50,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:50,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:24:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405416048] [2023-02-17 08:24:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:50,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:24:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:24:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:24:50,116 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-17 08:24:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:50,137 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-02-17 08:24:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:24:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-17 08:24:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:50,138 INFO L225 Difference]: With dead ends: 77 [2023-02-17 08:24:50,138 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 08:24:50,138 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-17 08:24:50,139 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:50,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 08:24:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-17 08:24:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 76 states have internal predecessors, (85), 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-17 08:24:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-02-17 08:24:50,141 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 15 [2023-02-17 08:24:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:50,141 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-02-17 08:24:50,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-17 08:24:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-02-17 08:24:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 08:24:50,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:50,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:50,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 08:24:50,142 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash 685561808, now seen corresponding path program 1 times [2023-02-17 08:24:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:50,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558594254] [2023-02-17 08:24:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:24:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:50,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558594254] [2023-02-17 08:24:50,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558594254] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:50,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:50,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:24:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341007091] [2023-02-17 08:24:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:50,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:24:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:50,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:24:50,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:24:50,205 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-17 08:24:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:50,230 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2023-02-17 08:24:50,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:24:50,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-17 08:24:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:50,231 INFO L225 Difference]: With dead ends: 65 [2023-02-17 08:24:50,231 INFO L226 Difference]: Without dead ends: 65 [2023-02-17 08:24:50,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:24:50,231 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:50,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 40 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-17 08:24:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-17 08:24:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 64 states have internal predecessors, (72), 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-17 08:24:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2023-02-17 08:24:50,234 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 15 [2023-02-17 08:24:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:50,234 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2023-02-17 08:24:50,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-17 08:24:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2023-02-17 08:24:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:24:50,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:50,237 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:50,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 08:24:50,237 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:50,238 INFO L85 PathProgramCache]: Analyzing trace with hash 381862667, now seen corresponding path program 2 times [2023-02-17 08:24:50,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:50,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652108795] [2023-02-17 08:24:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:50,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652108795] [2023-02-17 08:24:50,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652108795] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:50,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464938146] [2023-02-17 08:24:50,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:24:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:50,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:24:50,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 08:24:50,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:24:50,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:24:50,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:24:50,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:50,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464938146] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:50,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:24:50,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-17 08:24:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041215489] [2023-02-17 08:24:50,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:50,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:24:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:24:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:24:50,387 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-17 08:24:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:50,447 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2023-02-17 08:24:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:24:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 17 [2023-02-17 08:24:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:50,447 INFO L225 Difference]: With dead ends: 96 [2023-02-17 08:24:50,447 INFO L226 Difference]: Without dead ends: 96 [2023-02-17 08:24:50,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:24:50,448 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:50,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 187 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:24:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-17 08:24:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 64. [2023-02-17 08:24:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 63 states have internal predecessors, (69), 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-17 08:24:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2023-02-17 08:24:50,450 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 17 [2023-02-17 08:24:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:50,451 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2023-02-17 08:24:50,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-17 08:24:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2023-02-17 08:24:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:24:50,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:50,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:50,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:50,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-17 08:24:50,658 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1002343613, now seen corresponding path program 1 times [2023-02-17 08:24:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:50,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145132256] [2023-02-17 08:24:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:24:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:50,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145132256] [2023-02-17 08:24:50,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145132256] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:24:50,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:24:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:24:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854168790] [2023-02-17 08:24:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:50,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:24:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:50,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:24:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:50,676 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-17 08:24:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:50,683 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2023-02-17 08:24:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:24:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2023-02-17 08:24:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:50,684 INFO L225 Difference]: With dead ends: 62 [2023-02-17 08:24:50,684 INFO L226 Difference]: Without dead ends: 62 [2023-02-17 08:24:50,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:24:50,685 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:50,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-17 08:24:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-02-17 08:24:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 61 states have internal predecessors, (67), 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-17 08:24:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-02-17 08:24:50,686 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2023-02-17 08:24:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:50,686 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-02-17 08:24:50,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-17 08:24:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-02-17 08:24:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 08:24:50,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:50,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:50,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 08:24:50,689 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1897750454, now seen corresponding path program 1 times [2023-02-17 08:24:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:50,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362244253] [2023-02-17 08:24:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:50,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:24:50,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362244253] [2023-02-17 08:24:50,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362244253] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:50,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602264936] [2023-02-17 08:24:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:50,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:50,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:50,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:24:50,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 08:24:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:50,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:24:50,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:50,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:50,849 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 1 case distinctions, treesize of input 17 treesize of output 37 [2023-02-17 08:24:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:24:50,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:24:51,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602264936] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:51,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:24:51,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 18 [2023-02-17 08:24:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970823661] [2023-02-17 08:24:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:24:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:24:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:24:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-02-17 08:24:51,057 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-17 08:24:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:51,146 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2023-02-17 08:24:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:24:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 19 [2023-02-17 08:24:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:51,146 INFO L225 Difference]: With dead ends: 77 [2023-02-17 08:24:51,146 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 08:24:51,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2023-02-17 08:24:51,147 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:51,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 51 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:24:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 08:24:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2023-02-17 08:24:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 62 states have internal predecessors, (67), 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-17 08:24:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2023-02-17 08:24:51,148 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 19 [2023-02-17 08:24:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:51,148 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2023-02-17 08:24:51,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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-17 08:24:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2023-02-17 08:24:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 08:24:51,149 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:51,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:51,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:51,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-17 08:24:51,350 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash -951175098, now seen corresponding path program 3 times [2023-02-17 08:24:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:51,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393325711] [2023-02-17 08:24:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:24:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:24:51,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 08:24:51,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393325711] [2023-02-17 08:24:51,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393325711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:24:51,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675911869] [2023-02-17 08:24:51,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 08:24:51,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:51,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:24:51,503 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 08:24:51,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 08:24:51,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 08:24:51,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:24:51,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:24:51,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:24:51,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:24:51,562 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 1 case distinctions, treesize of input 17 treesize of output 37 [2023-02-17 08:24:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 08:24:51,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:24:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 08:24:51,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675911869] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:24:51,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 08:24:51,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2023-02-17 08:24:51,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983993345] [2023-02-17 08:24:51,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 08:24:51,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 08:24:51,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 08:24:51,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 08:24:51,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-02-17 08:24:51,781 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 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-17 08:24:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:24:52,331 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2023-02-17 08:24:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 08:24:52,332 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 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 19 [2023-02-17 08:24:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:24:52,332 INFO L225 Difference]: With dead ends: 98 [2023-02-17 08:24:52,332 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 08:24:52,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 08:24:52,333 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 265 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:24:52,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 191 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:24:52,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 08:24:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2023-02-17 08:24:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 65 states have internal predecessors, (70), 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-17 08:24:52,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2023-02-17 08:24:52,335 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 19 [2023-02-17 08:24:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:24:52,335 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2023-02-17 08:24:52,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 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-17 08:24:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2023-02-17 08:24:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 08:24:52,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:24:52,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:52,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 08:24:52,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 08:24:52,536 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:24:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:24:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1179541311, now seen corresponding path program 1 times [2023-02-17 08:24:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 08:24:52,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876563392] [2023-02-17 08:24:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:24:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 08:24:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:24:52,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 08:24:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:24:52,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 08:24:52,563 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 08:24:52,564 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (20 of 21 remaining) [2023-02-17 08:24:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2023-02-17 08:24:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2023-02-17 08:24:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2023-02-17 08:24:52,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2023-02-17 08:24:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2023-02-17 08:24:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2023-02-17 08:24:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2023-02-17 08:24:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2023-02-17 08:24:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2023-02-17 08:24:52,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2023-02-17 08:24:52,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2023-02-17 08:24:52,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2023-02-17 08:24:52,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2023-02-17 08:24:52,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2023-02-17 08:24:52,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2023-02-17 08:24:52,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2023-02-17 08:24:52,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2023-02-17 08:24:52,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2023-02-17 08:24:52,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2023-02-17 08:24:52,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2023-02-17 08:24:52,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 08:24:52,570 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:24:52,573 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 08:24:52,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 08:24:52 BoogieIcfgContainer [2023-02-17 08:24:52,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 08:24:52,592 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 08:24:52,592 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 08:24:52,593 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 08:24:52,593 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:24:47" (3/4) ... [2023-02-17 08:24:52,594 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 08:24:52,627 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 08:24:52,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 08:24:52,628 INFO L158 Benchmark]: Toolchain (without parser) took 6262.24ms. Allocated memory was 134.2MB in the beginning and 207.6MB in the end (delta: 73.4MB). Free memory was 93.9MB in the beginning and 149.7MB in the end (delta: -55.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-02-17 08:24:52,628 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:24:52,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.94ms. Allocated memory is still 134.2MB. Free memory was 93.9MB in the beginning and 77.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-17 08:24:52,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.74ms. Allocated memory is still 134.2MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 08:24:52,628 INFO L158 Benchmark]: Boogie Preprocessor took 20.11ms. Allocated memory is still 134.2MB. Free memory was 75.5MB in the beginning and 74.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 08:24:52,629 INFO L158 Benchmark]: RCFGBuilder took 302.39ms. Allocated memory is still 134.2MB. Free memory was 74.3MB in the beginning and 61.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:24:52,629 INFO L158 Benchmark]: TraceAbstraction took 5542.05ms. Allocated memory was 134.2MB in the beginning and 207.6MB in the end (delta: 73.4MB). Free memory was 60.4MB in the beginning and 151.8MB in the end (delta: -91.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:24:52,629 INFO L158 Benchmark]: Witness Printer took 34.56ms. Allocated memory is still 207.6MB. Free memory was 151.8MB in the beginning and 149.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 08:24:52,630 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.13ms. Allocated memory is still 134.2MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.94ms. Allocated memory is still 134.2MB. Free memory was 93.9MB in the beginning and 77.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.74ms. Allocated memory is still 134.2MB. Free memory was 77.6MB in the beginning and 75.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.11ms. Allocated memory is still 134.2MB. Free memory was 75.5MB in the beginning and 74.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.39ms. Allocated memory is still 134.2MB. Free memory was 74.3MB in the beginning and 61.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5542.05ms. Allocated memory was 134.2MB in the beginning and 207.6MB in the end (delta: 73.4MB). Free memory was 60.4MB in the beginning and 151.8MB in the end (delta: -91.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 34.56ms. Allocated memory is still 207.6MB. Free memory was 151.8MB in the beginning and 149.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 547]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L536] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L537] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L540] a = malloc(n * sizeof(*a)) [L541] b = malloc(n * sizeof(*b)) [L542] EXPR b++ VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=1] [L542] *b++ = 0 VAL [a={-3:0}, b={-2:4}, b++={-2:0}, n=1] [L543] CALL foo() [L528] int i; [L529] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L529] COND TRUE i < n VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L530] a[i] = -1 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L529] i++ VAL [a={-3:0}, b={-2:4}, i=1, n=1] [L529] COND FALSE !(i < n) VAL [a={-3:0}, b={-2:4}, i=1, n=1] [L531] i = 0 VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L531] COND FALSE !(i < n - 1) VAL [a={-3:0}, b={-2:4}, i=0, n=1] [L543] RET foo() [L544] b[-1] VAL [a={-3:0}, b={-2:4}, b[-1]=0, n=1] [L544] COND FALSE !(b[-1]) [L547] free(a) VAL [a={-3:0}, b={-2:4}, n=1] [L547] free(a) VAL [a={-3:0}, b={-2:4}, n=1] [L547] free(a) [L547] free(b) VAL [a={-3:0}, b={-2:4}, n=1] - 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: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1721 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 2094 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1347 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1692 IncrementalHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 747 mSDtfsCounter, 1692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 410 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 318 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 347 ConstructedInterpolants, 21 QuantifiedInterpolants, 6266 SizeOfPredicates, 25 NumberOfNonLiveVariables, 647 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 57/116 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 proved your program to be incorrect! [2023-02-17 08:24:52,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)