./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/heap-manipulation/sll_to_dll_rev-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:57:05,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:57:05,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:57:05,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:57:05,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:57:05,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:57:05,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:57:05,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:57:05,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:57:05,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:57:05,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:57:05,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:57:05,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:57:05,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:57:05,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:57:05,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:57:05,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:57:05,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:57:05,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:57:05,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:57:05,399 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:57:05,402 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:57:05,402 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:57:05,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:57:05,403 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:57:05,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:57:05,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:57:05,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:57:05,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:57:05,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:57:05,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:57:05,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:57:05,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:57:05,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:05,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:57:05,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:57:05,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:57:05,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:57:05,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:57:05,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:57:05,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:57:05,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:57:05,408 INFO L153 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 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2024-11-09 07:57:05,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:57:05,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:57:05,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:57:05,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:57:05,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:57:05,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-09 07:57:06,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:57:07,099 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:57:07,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-09 07:57:07,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbb84d2d/2d41ee9a78e548e4b00da0826a44006b/FLAGc7b0dc33d [2024-11-09 07:57:07,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbb84d2d/2d41ee9a78e548e4b00da0826a44006b [2024-11-09 07:57:07,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:57:07,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:57:07,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:07,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:57:07,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:57:07,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea271f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07, skipping insertion in model container [2024-11-09 07:57:07,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:57:07,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:07,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:57:07,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:57:07,477 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:57:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07 WrapperNode [2024-11-09 07:57:07,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:57:07,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:07,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:57:07,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:57:07,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,524 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-09 07:57:07,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:57:07,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:57:07,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:57:07,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:57:07,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,566 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 18, 6, 8, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1, 0, 0]. The 10 writes are split as follows [0, 7, 1, 1, 1]. [2024-11-09 07:57:07,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:57:07,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:57:07,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:57:07,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:57:07,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (1/1) ... [2024-11-09 07:57:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:57:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:07,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:57:07,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:57:07,664 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-09 07:57:07,664 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-09 07:57:07,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:57:07,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:57:07,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:57:07,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:57:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:57:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:57:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 07:57:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 07:57:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:57:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:57:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:57:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 07:57:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 07:57:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-09 07:57:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-09 07:57:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:57:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:57:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:57:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 07:57:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 07:57:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-09 07:57:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-09 07:57:07,669 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-09 07:57:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:57:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:57:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:57:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 07:57:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 07:57:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-09 07:57:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-09 07:57:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:57:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:57:07,803 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:57:07,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:57:08,233 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-11-09 07:57:08,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:57:08,249 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:57:08,250 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-09 07:57:08,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:08 BoogieIcfgContainer [2024-11-09 07:57:08,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:57:08,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:57:08,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:57:08,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:57:08,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:57:07" (1/3) ... [2024-11-09 07:57:08,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417dc04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:08, skipping insertion in model container [2024-11-09 07:57:08,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:57:07" (2/3) ... [2024-11-09 07:57:08,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417dc04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:57:08, skipping insertion in model container [2024-11-09 07:57:08,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:57:08" (3/3) ... [2024-11-09 07:57:08,256 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-09 07:57:08,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:57:08,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-09 07:57:08,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:57:08,312 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6cbc858b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:57:08,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-09 07:57:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 123 states have (on average 2.073170731707317) internal successors, (255), 211 states have internal predecessors, (255), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-09 07:57:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:57:08,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:08,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:57:08,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:08,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash 6467046, now seen corresponding path program 1 times [2024-11-09 07:57:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065003450] [2024-11-09 07:57:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:08,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065003450] [2024-11-09 07:57:08,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065003450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:08,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:08,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:08,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178712265] [2024-11-09 07:57:08,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:08,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:57:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:08,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:57:08,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:57:08,513 INFO L87 Difference]: Start difference. First operand has 225 states, 123 states have (on average 2.073170731707317) internal successors, (255), 211 states have internal predecessors, (255), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:08,561 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2024-11-09 07:57:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:57:08,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 07:57:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:08,570 INFO L225 Difference]: With dead ends: 222 [2024-11-09 07:57:08,570 INFO L226 Difference]: Without dead ends: 220 [2024-11-09 07:57:08,571 INFO L431 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 [2024-11-09 07:57:08,574 INFO L432 NwaCegarLoop]: 243 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, 243 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 [2024-11-09 07:57:08,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:57:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-09 07:57:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-09 07:57:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 117 states have (on average 1.8376068376068375) internal successors, (215), 206 states have internal predecessors, (215), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 241 transitions. [2024-11-09 07:57:08,613 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 241 transitions. Word has length 4 [2024-11-09 07:57:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 241 transitions. [2024-11-09 07:57:08,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 241 transitions. [2024-11-09 07:57:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:57:08,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:08,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:57:08,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:57:08,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1928521722, now seen corresponding path program 1 times [2024-11-09 07:57:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120752659] [2024-11-09 07:57:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120752659] [2024-11-09 07:57:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120752659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716495916] [2024-11-09 07:57:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:08,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:08,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:08,740 INFO L87 Difference]: Start difference. First operand 220 states and 241 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:08,910 INFO L93 Difference]: Finished difference Result 218 states and 239 transitions. [2024-11-09 07:57:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:08,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:57:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:08,912 INFO L225 Difference]: With dead ends: 218 [2024-11-09 07:57:08,912 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 07:57:08,912 INFO L431 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 [2024-11-09 07:57:08,913 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:08,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 383 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 07:57:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-09 07:57:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 117 states have (on average 1.8205128205128205) internal successors, (213), 204 states have internal predecessors, (213), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 239 transitions. [2024-11-09 07:57:08,935 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 239 transitions. Word has length 6 [2024-11-09 07:57:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:08,935 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 239 transitions. [2024-11-09 07:57:08,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 239 transitions. [2024-11-09 07:57:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:57:08,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:08,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:57:08,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:57:08,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:08,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1928521723, now seen corresponding path program 1 times [2024-11-09 07:57:08,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577387591] [2024-11-09 07:57:08,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:09,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:09,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577387591] [2024-11-09 07:57:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577387591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:09,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:09,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:57:09,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205463814] [2024-11-09 07:57:09,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:09,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:57:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:09,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:57:09,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:57:09,072 INFO L87 Difference]: Start difference. First operand 218 states and 239 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:09,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:09,178 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2024-11-09 07:57:09,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:57:09,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:57:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:09,180 INFO L225 Difference]: With dead ends: 216 [2024-11-09 07:57:09,180 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 07:57:09,180 INFO L431 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 [2024-11-09 07:57:09,183 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:09,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 388 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 07:57:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-09 07:57:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 117 states have (on average 1.8034188034188035) internal successors, (211), 202 states have internal predecessors, (211), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 237 transitions. [2024-11-09 07:57:09,200 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 237 transitions. Word has length 6 [2024-11-09 07:57:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:09,201 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 237 transitions. [2024-11-09 07:57:09,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2024-11-09 07:57:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:57:09,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:09,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:09,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:57:09,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1860239838, now seen corresponding path program 1 times [2024-11-09 07:57:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096025596] [2024-11-09 07:57:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:09,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096025596] [2024-11-09 07:57:09,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096025596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:09,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:09,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:09,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654137894] [2024-11-09 07:57:09,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:09,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:09,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:09,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:09,415 INFO L87 Difference]: Start difference. First operand 216 states and 237 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:09,651 INFO L93 Difference]: Finished difference Result 211 states and 232 transitions. [2024-11-09 07:57:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:09,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:57:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:09,652 INFO L225 Difference]: With dead ends: 211 [2024-11-09 07:57:09,653 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 07:57:09,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:09,654 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:09,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 747 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 07:57:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-09 07:57:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 117 states have (on average 1.7606837606837606) internal successors, (206), 197 states have internal predecessors, (206), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 232 transitions. [2024-11-09 07:57:09,664 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 232 transitions. Word has length 10 [2024-11-09 07:57:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:09,665 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 232 transitions. [2024-11-09 07:57:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 232 transitions. [2024-11-09 07:57:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:57:09,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:09,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:09,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:57:09,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:09,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1860239839, now seen corresponding path program 1 times [2024-11-09 07:57:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:09,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445193600] [2024-11-09 07:57:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:09,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445193600] [2024-11-09 07:57:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445193600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:09,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:09,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917702277] [2024-11-09 07:57:09,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:09,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:09,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:09,877 INFO L87 Difference]: Start difference. First operand 211 states and 232 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:10,164 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2024-11-09 07:57:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:57:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:10,166 INFO L225 Difference]: With dead ends: 206 [2024-11-09 07:57:10,166 INFO L226 Difference]: Without dead ends: 206 [2024-11-09 07:57:10,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:10,167 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 36 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:10,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 550 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-09 07:57:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-09 07:57:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 117 states have (on average 1.7179487179487178) internal successors, (201), 192 states have internal predecessors, (201), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2024-11-09 07:57:10,179 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 10 [2024-11-09 07:57:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:10,179 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2024-11-09 07:57:10,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2024-11-09 07:57:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:57:10,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:10,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:57:10,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:10,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1832860119, now seen corresponding path program 1 times [2024-11-09 07:57:10,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:10,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343768135] [2024-11-09 07:57:10,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:10,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343768135] [2024-11-09 07:57:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343768135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:10,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:10,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:57:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949971423] [2024-11-09 07:57:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:10,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:10,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:10,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:10,245 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:10,395 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2024-11-09 07:57:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:10,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:57:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:10,397 INFO L225 Difference]: With dead ends: 205 [2024-11-09 07:57:10,397 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 07:57:10,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:57:10,398 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 3 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:10,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 648 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 07:57:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-09 07:57:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 117 states have (on average 1.7094017094017093) internal successors, (200), 191 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2024-11-09 07:57:10,407 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 11 [2024-11-09 07:57:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:10,407 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2024-11-09 07:57:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2024-11-09 07:57:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:57:10,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:10,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:10,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:57:10,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:10,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1832860120, now seen corresponding path program 1 times [2024-11-09 07:57:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:10,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349044819] [2024-11-09 07:57:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349044819] [2024-11-09 07:57:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349044819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:57:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364013922] [2024-11-09 07:57:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:10,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:57:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:10,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:57:10,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:10,517 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:10,663 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2024-11-09 07:57:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:57:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:10,664 INFO L225 Difference]: With dead ends: 204 [2024-11-09 07:57:10,664 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 07:57:10,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:57:10,665 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 4 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:10,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 730 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 07:57:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-09 07:57:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 190 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2024-11-09 07:57:10,673 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2024-11-09 07:57:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:10,674 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2024-11-09 07:57:10,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:57:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2024-11-09 07:57:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:57:10,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:10,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:10,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:57:10,675 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -502411055, now seen corresponding path program 1 times [2024-11-09 07:57:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126505947] [2024-11-09 07:57:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:10,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126505947] [2024-11-09 07:57:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126505947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:10,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:10,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:57:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041376745] [2024-11-09 07:57:10,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:10,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:57:10,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:10,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:57:10,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:10,942 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:57:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:11,358 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2024-11-09 07:57:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 07:57:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:11,360 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:57:11,360 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:57:11,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:11,361 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 55 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:11,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 461 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:57:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-09 07:57:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 189 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2024-11-09 07:57:11,367 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 19 [2024-11-09 07:57:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2024-11-09 07:57:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:57:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2024-11-09 07:57:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:57:11,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:11,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:11,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:57:11,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:11,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:11,369 INFO L85 PathProgramCache]: Analyzing trace with hash -502411054, now seen corresponding path program 1 times [2024-11-09 07:57:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174935865] [2024-11-09 07:57:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:11,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:11,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:11,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174935865] [2024-11-09 07:57:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174935865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:11,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:11,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:57:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265859792] [2024-11-09 07:57:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:11,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:57:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:57:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:11,754 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:57:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:12,074 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2024-11-09 07:57:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:57:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 07:57:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:12,077 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:57:12,077 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:57:12,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:12,078 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 97 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:12,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 344 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:57:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2024-11-09 07:57:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 117 states have (on average 1.6837606837606838) internal successors, (197), 188 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2024-11-09 07:57:12,086 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2024-11-09 07:57:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:12,086 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2024-11-09 07:57:12,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:57:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2024-11-09 07:57:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:57:12,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:12,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:12,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:57:12,088 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:12,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 45731933, now seen corresponding path program 1 times [2024-11-09 07:57:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:12,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798555128] [2024-11-09 07:57:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:57:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:12,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:12,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798555128] [2024-11-09 07:57:12,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798555128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:12,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56459933] [2024-11-09 07:57:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:12,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:12,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:12,558 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) [2024-11-09 07:57:12,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:57:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:12,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:57:12,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:12,767 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:12,768 INFO L378 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 11 treesize of output 9 [2024-11-09 07:57:12,801 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2024-11-09 07:57:12,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 07:57:12,851 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#valid| |chain_node_alloc_node_~ptr~0#1.base|))))) is different from true [2024-11-09 07:57:12,958 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 07:57:12,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2024-11-09 07:57:13,090 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2024-11-09 07:57:13,131 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2024-11-09 07:57:13,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 43 [2024-11-09 07:57:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2024-11-09 07:57:13,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56459933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:13,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:13,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-11-09 07:57:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752798332] [2024-11-09 07:57:13,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:13,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:57:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:57:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=441, Unknown=2, NotChecked=90, Total=650 [2024-11-09 07:57:13,709 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 18 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:57:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:14,557 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2024-11-09 07:57:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2024-11-09 07:57:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:14,559 INFO L225 Difference]: With dead ends: 201 [2024-11-09 07:57:14,559 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 07:57:14,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=696, Unknown=2, NotChecked=114, Total=992 [2024-11-09 07:57:14,560 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 252 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:14,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 858 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1040 Invalid, 0 Unknown, 429 Unchecked, 0.6s Time] [2024-11-09 07:57:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 07:57:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-09 07:57:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 117 states have (on average 1.6752136752136753) internal successors, (196), 187 states have internal predecessors, (196), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2024-11-09 07:57:14,564 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 37 [2024-11-09 07:57:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:14,564 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2024-11-09 07:57:14,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:57:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2024-11-09 07:57:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:57:14,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:14,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:14,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:57:14,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:57:14,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash 45731934, now seen corresponding path program 1 times [2024-11-09 07:57:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923052322] [2024-11-09 07:57:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:57:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:57:15,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:15,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923052322] [2024-11-09 07:57:15,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923052322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:15,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:15,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:57:15,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345652743] [2024-11-09 07:57:15,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:15,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:57:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:15,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:57:15,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:15,335 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:15,706 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2024-11-09 07:57:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:57:15,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-09 07:57:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:15,707 INFO L225 Difference]: With dead ends: 200 [2024-11-09 07:57:15,707 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 07:57:15,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:57:15,708 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 58 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:15,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 379 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 07:57:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-11-09 07:57:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 117 states have (on average 1.6666666666666667) internal successors, (195), 186 states have internal predecessors, (195), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2024-11-09 07:57:15,712 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 37 [2024-11-09 07:57:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:15,713 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2024-11-09 07:57:15,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2024-11-09 07:57:15,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 07:57:15,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:15,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:15,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:57:15,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:15,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1491506621, now seen corresponding path program 1 times [2024-11-09 07:57:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:15,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027967859] [2024-11-09 07:57:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:15,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:57:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:57:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:57:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027967859] [2024-11-09 07:57:16,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027967859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:16,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023990361] [2024-11-09 07:57:16,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:16,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:16,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:16,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:16,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:16,112 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:16,611 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2024-11-09 07:57:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2024-11-09 07:57:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:16,614 INFO L225 Difference]: With dead ends: 205 [2024-11-09 07:57:16,614 INFO L226 Difference]: Without dead ends: 205 [2024-11-09 07:57:16,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:16,614 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 165 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:16,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 434 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:57:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-09 07:57:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2024-11-09 07:57:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 117 states have (on average 1.606837606837607) internal successors, (188), 179 states have internal predecessors, (188), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:57:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2024-11-09 07:57:16,623 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 58 [2024-11-09 07:57:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:16,623 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2024-11-09 07:57:16,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2024-11-09 07:57:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 07:57:16,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:16,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:16,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:57:16,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:16,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1491506620, now seen corresponding path program 1 times [2024-11-09 07:57:16,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094515633] [2024-11-09 07:57:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:16,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:57:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:57:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:57:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094515633] [2024-11-09 07:57:16,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094515633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:16,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:16,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050949760] [2024-11-09 07:57:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:16,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:16,979 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:17,434 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2024-11-09 07:57:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:17,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2024-11-09 07:57:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:17,436 INFO L225 Difference]: With dead ends: 204 [2024-11-09 07:57:17,436 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 07:57:17,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:17,436 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 190 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:17,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 269 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 07:57:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 195. [2024-11-09 07:57:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 124 states have (on average 1.532258064516129) internal successors, (190), 180 states have internal predecessors, (190), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 218 transitions. [2024-11-09 07:57:17,447 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 218 transitions. Word has length 58 [2024-11-09 07:57:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 218 transitions. [2024-11-09 07:57:17,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 218 transitions. [2024-11-09 07:57:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 07:57:17,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:17,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:17,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:57:17,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:17,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:17,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1007935234, now seen corresponding path program 1 times [2024-11-09 07:57:17,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:17,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64197688] [2024-11-09 07:57:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:17,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:17,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:57:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:17,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:57:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:57:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64197688] [2024-11-09 07:57:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64197688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:17,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:17,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:17,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896982835] [2024-11-09 07:57:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:17,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:17,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:17,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:17,883 INFO L87 Difference]: Start difference. First operand 195 states and 218 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:18,342 INFO L93 Difference]: Finished difference Result 200 states and 224 transitions. [2024-11-09 07:57:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-11-09 07:57:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:18,343 INFO L225 Difference]: With dead ends: 200 [2024-11-09 07:57:18,343 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 07:57:18,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:18,344 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 193 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:18,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 396 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 07:57:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 188. [2024-11-09 07:57:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 173 states have internal predecessors, (183), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2024-11-09 07:57:18,348 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 59 [2024-11-09 07:57:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:18,348 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2024-11-09 07:57:18,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2024-11-09 07:57:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 07:57:18,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:18,351 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:18,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:57:18,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:18,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1007935235, now seen corresponding path program 1 times [2024-11-09 07:57:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030823614] [2024-11-09 07:57:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:57:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:57:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:57:18,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:18,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030823614] [2024-11-09 07:57:18,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030823614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:18,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:18,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:57:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693864656] [2024-11-09 07:57:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:57:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:57:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:18,804 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:57:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:19,220 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2024-11-09 07:57:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:19,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-11-09 07:57:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:19,221 INFO L225 Difference]: With dead ends: 183 [2024-11-09 07:57:19,221 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 07:57:19,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:57:19,222 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 183 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:19,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 247 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 07:57:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-09 07:57:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 166 states have internal predecessors, (176), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 204 transitions. [2024-11-09 07:57:19,226 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 204 transitions. Word has length 59 [2024-11-09 07:57:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:19,226 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 204 transitions. [2024-11-09 07:57:19,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:57:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 204 transitions. [2024-11-09 07:57:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 07:57:19,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:19,227 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:19,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:57:19,228 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:57:19,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1384284051, now seen corresponding path program 1 times [2024-11-09 07:57:19,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:19,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943317040] [2024-11-09 07:57:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:19,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:57:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:19,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:57:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:57:19,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943317040] [2024-11-09 07:57:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943317040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697822957] [2024-11-09 07:57:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:19,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:19,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:19,669 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) [2024-11-09 07:57:19,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:57:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:19,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:57:19,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:20,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:20,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:20,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:20,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:20,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:20,365 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:20,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:20,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:20,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:20,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 07:57:20,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 07:57:20,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-09 07:57:20,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 07:57:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:57:20,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697822957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:20,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 32 [2024-11-09 07:57:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299251142] [2024-11-09 07:57:20,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:20,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:57:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:20,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:57:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:57:20,929 INFO L87 Difference]: Start difference. First operand 181 states and 204 transitions. Second operand has 32 states, 32 states have (on average 3.40625) internal successors, (109), 30 states have internal predecessors, (109), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 07:57:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:28,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:33,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:37,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:41,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:45,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:49,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:53,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:57:57,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:01,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:02,404 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2024-11-09 07:58:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:58:02,405 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 30 states have internal predecessors, (109), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 66 [2024-11-09 07:58:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:02,406 INFO L225 Difference]: With dead ends: 224 [2024-11-09 07:58:02,406 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 07:58:02,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=2229, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:58:02,407 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 435 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 51 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:02,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1886 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1755 Invalid, 10 Unknown, 0 Unchecked, 41.0s Time] [2024-11-09 07:58:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 07:58:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2024-11-09 07:58:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 148 states have (on average 1.3986486486486487) internal successors, (207), 190 states have internal predecessors, (207), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:58:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2024-11-09 07:58:02,414 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 66 [2024-11-09 07:58:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2024-11-09 07:58:02,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 30 states have internal predecessors, (109), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 07:58:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2024-11-09 07:58:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 07:58:02,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:02,415 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:02,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:58:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 07:58:02,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:58:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1374309996, now seen corresponding path program 1 times [2024-11-09 07:58:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851606730] [2024-11-09 07:58:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:58:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:58:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:58:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:58:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851606730] [2024-11-09 07:58:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851606730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660052255] [2024-11-09 07:58:03,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:03,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:03,384 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) [2024-11-09 07:58:03,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:58:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:03,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 07:58:03,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:03,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:03,926 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:58:03,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 07:58:04,031 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:04,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:04,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2024-11-09 07:58:04,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:04,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:58:04,202 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1))) is different from true [2024-11-09 07:58:04,218 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 07:58:04,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 07:58:04,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:58:04,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:04,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:04,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 07:58:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-11-09 07:58:04,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:58:04,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-09 07:58:04,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 07:58:04,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 07:58:04,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-11-09 07:58:04,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:04,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2024-11-09 07:58:04,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660052255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:04,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:58:04,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 37 [2024-11-09 07:58:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397785190] [2024-11-09 07:58:04,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:58:04,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:58:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:04,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:58:04,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1743, Unknown=1, NotChecked=84, Total=1980 [2024-11-09 07:58:04,908 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 38 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:58:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:06,563 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2024-11-09 07:58:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:58:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2024-11-09 07:58:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:06,565 INFO L225 Difference]: With dead ends: 213 [2024-11-09 07:58:06,565 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 07:58:06,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=333, Invalid=3092, Unknown=1, NotChecked=114, Total=3540 [2024-11-09 07:58:06,566 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 342 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:06,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1679 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2805 Invalid, 0 Unknown, 220 Unchecked, 1.2s Time] [2024-11-09 07:58:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 07:58:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2024-11-09 07:58:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 190 states have internal predecessors, (206), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:58:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 234 transitions. [2024-11-09 07:58:06,570 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 234 transitions. Word has length 66 [2024-11-09 07:58:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 234 transitions. [2024-11-09 07:58:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 35 states have internal predecessors, (110), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:58:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 234 transitions. [2024-11-09 07:58:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 07:58:06,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:06,572 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:06,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:58:06,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:06,776 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:58:06,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:06,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1374309997, now seen corresponding path program 1 times [2024-11-09 07:58:06,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:06,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934008762] [2024-11-09 07:58:06,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:06,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:07,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:58:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:58:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:58:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:58:07,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:07,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934008762] [2024-11-09 07:58:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934008762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:07,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600638773] [2024-11-09 07:58:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:07,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:07,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:07,581 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) [2024-11-09 07:58:07,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:58:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:07,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 07:58:07,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:07,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:58:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:58:07,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:08,105 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:08,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:58:08,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:08,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:08,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 07:58:08,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:08,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:58:08,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:58:08,288 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|chain_node_~node~0#1.base| Int)) (= (store |c_old(#length)| |chain_node_~node~0#1.base| 8) |c_#length|)) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_13| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_13|) 0) 0))) is different from true [2024-11-09 07:58:08,315 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 07:58:08,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 07:58:08,409 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:08,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:58:08,414 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:08,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:08,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-11-09 07:58:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-09 07:58:08,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:58:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600638773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:08,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:58:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2024-11-09 07:58:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264393702] [2024-11-09 07:58:08,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:58:08,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:58:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:58:08,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1100, Unknown=1, NotChecked=66, Total=1260 [2024-11-09 07:58:08,607 INFO L87 Difference]: Start difference. First operand 207 states and 234 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:58:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:10,892 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2024-11-09 07:58:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:58:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2024-11-09 07:58:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:10,893 INFO L225 Difference]: With dead ends: 247 [2024-11-09 07:58:10,893 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 07:58:10,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=2938, Unknown=1, NotChecked=110, Total=3306 [2024-11-09 07:58:10,894 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 284 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 3211 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:10,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1591 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3211 Invalid, 0 Unknown, 260 Unchecked, 1.5s Time] [2024-11-09 07:58:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 07:58:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 221. [2024-11-09 07:58:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 161 states have (on average 1.4037267080745341) internal successors, (226), 203 states have internal predecessors, (226), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:58:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2024-11-09 07:58:10,898 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 254 transitions. Word has length 66 [2024-11-09 07:58:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:10,899 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 254 transitions. [2024-11-09 07:58:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 28 states have internal predecessors, (100), 5 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:58:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 254 transitions. [2024-11-09 07:58:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 07:58:10,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:10,899 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:10,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:58:11,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 07:58:11,100 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, chain_nodeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-09 07:58:11,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2128471491, now seen corresponding path program 1 times [2024-11-09 07:58:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:11,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340651128] [2024-11-09 07:58:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:58:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 07:58:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:11,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 07:58:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:58:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340651128] [2024-11-09 07:58:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340651128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164079826] [2024-11-09 07:58:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:11,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:11,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:11,448 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) [2024-11-09 07:58:11,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:58:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:11,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 07:58:11,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:11,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:11,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:11,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:11,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:58:11,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:12,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:58:12,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:58:12,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:58:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 07:58:12,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:58:12,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 07:58:12,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 07:58:12,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-09 07:58:12,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 07:58:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 07:58:12,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164079826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:58:12,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:58:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 32 [2024-11-09 07:58:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159268480] [2024-11-09 07:58:12,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:58:12,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:58:12,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:12,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:58:12,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:58:12,612 INFO L87 Difference]: Start difference. First operand 221 states and 254 transitions. Second operand has 32 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 30 states have internal predecessors, (107), 7 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 07:58:16,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:20,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:24,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:28,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:32,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:36,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:58:40,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]