./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:58:34,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:58:34,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:58:34,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:58:34,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:58:34,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:58:34,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:58:34,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:58:34,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:58:34,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:58:34,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:58:34,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:58:34,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:58:34,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:58:34,441 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:58:34,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:58:34,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:58:34,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:58:34,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:58:34,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:58:34,444 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:58:34,445 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:58:34,445 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:58:34,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:58:34,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:58:34,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:58:34,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:58:34,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:58:34,446 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:58:34,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:58:34,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:58:34,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:58:34,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:58:34,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:58:34,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:58:34,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:58:34,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:58:34,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:58:34,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:58:34,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:58:34,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:58:34,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:58:34,452 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-clean/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-clean/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 -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2024-10-11 17:58:34,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:58:34,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:58:34,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:58:34,670 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:58:34,671 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:58:34,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2024-10-11 17:58:35,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:58:36,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:58:36,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2024-10-11 17:58:36,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f231afac/1a5e9ed891d44a888a78d24708262f42/FLAG842693af1 [2024-10-11 17:58:36,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f231afac/1a5e9ed891d44a888a78d24708262f42 [2024-10-11 17:58:36,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:58:36,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:58:36,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:58:36,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:58:36,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:58:36,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:36,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118a5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36, skipping insertion in model container [2024-10-11 17:58:36,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:36,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:58:36,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:58:36,865 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:58:36,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:58:36,924 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:58:36,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36 WrapperNode [2024-10-11 17:58:36,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:58:36,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:58:36,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:58:36,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:58:36,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:36,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:36,975 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 313 [2024-10-11 17:58:36,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:58:36,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:58:36,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:58:36,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:58:36,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:36,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:36,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,041 INFO L175 MemorySlicer]: Split 76 memory accesses to 6 slices as follows [2, 31, 3, 16, 8, 16]. 41 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 0, 1, 0, 2, 0]. The 26 writes are split as follows [0, 8, 1, 8, 1, 8]. [2024-10-11 17:58:37,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:58:37,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:58:37,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:58:37,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:58:37,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (1/1) ... [2024-10-11 17:58:37,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:58:37,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:58:37,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:58:37,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:58:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:58:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:58:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 17:58:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 17:58:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 17:58:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 17:58:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:58:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:58:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:58:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:58:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:58:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:58:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 17:58:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 17:58:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:58:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:58:37,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:58:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 17:58:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 17:58:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 17:58:37,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:58:37,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:58:37,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:58:37,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:58:37,923 INFO L? ?]: Removed 337 outVars from TransFormulas that were not future-live. [2024-10-11 17:58:37,923 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:58:37,980 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:58:37,981 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 17:58:37,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:58:37 BoogieIcfgContainer [2024-10-11 17:58:37,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:58:37,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:58:37,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:58:37,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:58:37,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:58:36" (1/3) ... [2024-10-11 17:58:37,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb366c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:58:37, skipping insertion in model container [2024-10-11 17:58:37,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:58:36" (2/3) ... [2024-10-11 17:58:37,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb366c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:58:37, skipping insertion in model container [2024-10-11 17:58:37,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:58:37" (3/3) ... [2024-10-11 17:58:37,989 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0521.i [2024-10-11 17:58:38,001 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:58:38,002 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2024-10-11 17:58:38,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:58:38,048 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;@5fb3a583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:58:38,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2024-10-11 17:58:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 132 states have (on average 2.4393939393939394) internal successors, (322), 284 states have internal predecessors, (322), 0 states have call successors, (0), 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-10-11 17:58:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:58:38,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:38,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:58:38,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:38,063 INFO L85 PathProgramCache]: Analyzing trace with hash 16842903, now seen corresponding path program 1 times [2024-10-11 17:58:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171891784] [2024-10-11 17:58:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:38,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171891784] [2024-10-11 17:58:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171891784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515671906] [2024-10-11 17:58:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:38,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:58:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:38,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:58:38,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:58:38,209 INFO L87 Difference]: Start difference. First operand has 285 states, 132 states have (on average 2.4393939393939394) internal successors, (322), 284 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.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-10-11 17:58:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:38,270 INFO L93 Difference]: Finished difference Result 285 states and 312 transitions. [2024-10-11 17:58:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:58:38,272 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-10-11 17:58:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:38,283 INFO L225 Difference]: With dead ends: 285 [2024-10-11 17:58:38,283 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 17:58:38,285 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-10-11 17:58:38,288 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:38,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:58:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 17:58:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-11 17:58:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 132 states have (on average 2.356060606060606) internal successors, (311), 283 states have internal predecessors, (311), 0 states have call successors, (0), 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-10-11 17:58:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 311 transitions. [2024-10-11 17:58:38,357 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 311 transitions. Word has length 4 [2024-10-11 17:58:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:38,358 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 311 transitions. [2024-10-11 17:58:38,358 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-10-11 17:58:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 311 transitions. [2024-10-11 17:58:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:58:38,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:38,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:58:38,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:58:38,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:38,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash 521085369, now seen corresponding path program 1 times [2024-10-11 17:58:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506803858] [2024-10-11 17:58:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:38,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:38,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506803858] [2024-10-11 17:58:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506803858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417713677] [2024-10-11 17:58:38,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:38,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:38,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:38,465 INFO L87 Difference]: Start difference. First operand 284 states and 311 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:38,670 INFO L93 Difference]: Finished difference Result 268 states and 295 transitions. [2024-10-11 17:58:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:38,671 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:58:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:38,672 INFO L225 Difference]: With dead ends: 268 [2024-10-11 17:58:38,672 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 17:58:38,672 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-10-11 17:58:38,677 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 58 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:38,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 334 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:58:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 17:58:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-10-11 17:58:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 132 states have (on average 2.234848484848485) internal successors, (295), 267 states have internal predecessors, (295), 0 states have call successors, (0), 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-10-11 17:58:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 295 transitions. [2024-10-11 17:58:38,693 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 295 transitions. Word has length 5 [2024-10-11 17:58:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:38,694 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 295 transitions. [2024-10-11 17:58:38,694 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), 0 states have call successors, (0), 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-10-11 17:58:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 295 transitions. [2024-10-11 17:58:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:58:38,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:38,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:58:38,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:58:38,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:38,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash 521085370, now seen corresponding path program 1 times [2024-10-11 17:58:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:38,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107964011] [2024-10-11 17:58:38,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:38,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107964011] [2024-10-11 17:58:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107964011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:38,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:38,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:38,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539886742] [2024-10-11 17:58:38,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:38,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:38,806 INFO L87 Difference]: Start difference. First operand 268 states and 295 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:39,044 INFO L93 Difference]: Finished difference Result 252 states and 279 transitions. [2024-10-11 17:58:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:39,045 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:58:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:39,045 INFO L225 Difference]: With dead ends: 252 [2024-10-11 17:58:39,046 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 17:58:39,046 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-10-11 17:58:39,046 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:39,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 343 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:58:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 17:58:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-10-11 17:58:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 132 states have (on average 2.1136363636363638) internal successors, (279), 251 states have internal predecessors, (279), 0 states have call successors, (0), 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-10-11 17:58:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 279 transitions. [2024-10-11 17:58:39,063 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 279 transitions. Word has length 5 [2024-10-11 17:58:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:39,063 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 279 transitions. [2024-10-11 17:58:39,064 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), 0 states have call successors, (0), 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-10-11 17:58:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 279 transitions. [2024-10-11 17:58:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:58:39,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:39,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:58:39,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:58:39,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:39,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash 521086460, now seen corresponding path program 1 times [2024-10-11 17:58:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:39,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386325754] [2024-10-11 17:58:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:39,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386325754] [2024-10-11 17:58:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386325754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839973036] [2024-10-11 17:58:39,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:39,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:39,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:39,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:39,114 INFO L87 Difference]: Start difference. First operand 252 states and 279 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:39,257 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions. [2024-10-11 17:58:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:39,258 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:58:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:39,259 INFO L225 Difference]: With dead ends: 250 [2024-10-11 17:58:39,259 INFO L226 Difference]: Without dead ends: 250 [2024-10-11 17:58:39,259 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-10-11 17:58:39,260 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:39,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 379 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-11 17:58:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2024-10-11 17:58:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 132 states have (on average 2.0984848484848486) internal successors, (277), 249 states have internal predecessors, (277), 0 states have call successors, (0), 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-10-11 17:58:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 277 transitions. [2024-10-11 17:58:39,271 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 277 transitions. Word has length 5 [2024-10-11 17:58:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:39,271 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 277 transitions. [2024-10-11 17:58:39,271 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), 0 states have call successors, (0), 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-10-11 17:58:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 277 transitions. [2024-10-11 17:58:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:58:39,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:39,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:58:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:58:39,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:39,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash 521086461, now seen corresponding path program 1 times [2024-10-11 17:58:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965512392] [2024-10-11 17:58:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:39,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:39,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965512392] [2024-10-11 17:58:39,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965512392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:39,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910815564] [2024-10-11 17:58:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:39,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:39,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:39,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:39,314 INFO L87 Difference]: Start difference. First operand 250 states and 277 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:39,462 INFO L93 Difference]: Finished difference Result 248 states and 275 transitions. [2024-10-11 17:58:39,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:39,462 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:58:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:39,463 INFO L225 Difference]: With dead ends: 248 [2024-10-11 17:58:39,463 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 17:58:39,464 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-10-11 17:58:39,465 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 4 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:39,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 17:58:39,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-10-11 17:58:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 132 states have (on average 2.0833333333333335) internal successors, (275), 247 states have internal predecessors, (275), 0 states have call successors, (0), 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-10-11 17:58:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 275 transitions. [2024-10-11 17:58:39,471 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 275 transitions. Word has length 5 [2024-10-11 17:58:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:39,471 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 275 transitions. [2024-10-11 17:58:39,471 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), 0 states have call successors, (0), 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-10-11 17:58:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 275 transitions. [2024-10-11 17:58:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:58:39,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:39,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:39,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:58:39,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1748133414, now seen corresponding path program 1 times [2024-10-11 17:58:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663082171] [2024-10-11 17:58:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:39,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:39,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663082171] [2024-10-11 17:58:39,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663082171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:39,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:39,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:58:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635258381] [2024-10-11 17:58:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:58:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:58:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:58:39,540 INFO L87 Difference]: Start difference. First operand 248 states and 275 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:39,635 INFO L93 Difference]: Finished difference Result 308 states and 343 transitions. [2024-10-11 17:58:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:58:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:58:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:39,636 INFO L225 Difference]: With dead ends: 308 [2024-10-11 17:58:39,637 INFO L226 Difference]: Without dead ends: 308 [2024-10-11 17:58:39,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:39,637 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 64 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:39,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 719 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-11 17:58:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2024-10-11 17:58:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 137 states have (on average 2.051094890510949) internal successors, (281), 252 states have internal predecessors, (281), 0 states have call successors, (0), 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-10-11 17:58:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 281 transitions. [2024-10-11 17:58:39,641 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 281 transitions. Word has length 7 [2024-10-11 17:58:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:39,642 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 281 transitions. [2024-10-11 17:58:39,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 281 transitions. [2024-10-11 17:58:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:58:39,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:39,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:39,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:58:39,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:39,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1690320253, now seen corresponding path program 1 times [2024-10-11 17:58:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112918919] [2024-10-11 17:58:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:39,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112918919] [2024-10-11 17:58:39,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112918919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:39,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195530457] [2024-10-11 17:58:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:39,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:39,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:39,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:39,678 INFO L87 Difference]: Start difference. First operand 253 states and 281 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:39,802 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2024-10-11 17:58:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:58:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:39,803 INFO L225 Difference]: With dead ends: 251 [2024-10-11 17:58:39,803 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 17:58:39,803 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-10-11 17:58:39,804 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:39,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 376 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 17:58:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-11 17:58:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 137 states have (on average 2.0364963503649633) internal successors, (279), 250 states have internal predecessors, (279), 0 states have call successors, (0), 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-10-11 17:58:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 279 transitions. [2024-10-11 17:58:39,807 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 279 transitions. Word has length 8 [2024-10-11 17:58:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:39,807 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 279 transitions. [2024-10-11 17:58:39,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 279 transitions. [2024-10-11 17:58:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:58:39,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:39,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:39,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:58:39,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:39,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1690320254, now seen corresponding path program 1 times [2024-10-11 17:58:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:39,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815056823] [2024-10-11 17:58:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815056823] [2024-10-11 17:58:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815056823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505556498] [2024-10-11 17:58:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:39,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:39,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:39,883 INFO L87 Difference]: Start difference. First operand 251 states and 279 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:40,067 INFO L93 Difference]: Finished difference Result 249 states and 277 transitions. [2024-10-11 17:58:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:40,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:58:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:40,068 INFO L225 Difference]: With dead ends: 249 [2024-10-11 17:58:40,068 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 17:58:40,068 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-10-11 17:58:40,069 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:40,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 386 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:58:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 17:58:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2024-10-11 17:58:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 137 states have (on average 2.021897810218978) internal successors, (277), 248 states have internal predecessors, (277), 0 states have call successors, (0), 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-10-11 17:58:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 277 transitions. [2024-10-11 17:58:40,072 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 277 transitions. Word has length 8 [2024-10-11 17:58:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:40,072 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 277 transitions. [2024-10-11 17:58:40,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 277 transitions. [2024-10-11 17:58:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:58:40,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:40,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:40,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:58:40,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:40,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:40,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1871519148, now seen corresponding path program 1 times [2024-10-11 17:58:40,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942600328] [2024-10-11 17:58:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942600328] [2024-10-11 17:58:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942600328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:40,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:40,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:58:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136205332] [2024-10-11 17:58:40,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:40,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:58:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:58:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:58:40,145 INFO L87 Difference]: Start difference. First operand 249 states and 277 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:40,297 INFO L93 Difference]: Finished difference Result 297 states and 332 transitions. [2024-10-11 17:58:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:58:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:58:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:40,298 INFO L225 Difference]: With dead ends: 297 [2024-10-11 17:58:40,298 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 17:58:40,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:58:40,298 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 75 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:40,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1170 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 17:58:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 252. [2024-10-11 17:58:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 140 states have (on average 2.0) internal successors, (280), 251 states have internal predecessors, (280), 0 states have call successors, (0), 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-10-11 17:58:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 280 transitions. [2024-10-11 17:58:40,302 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 280 transitions. Word has length 11 [2024-10-11 17:58:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:40,302 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 280 transitions. [2024-10-11 17:58:40,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2024-10-11 17:58:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:58:40,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:40,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:40,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:58:40,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1038499068, now seen corresponding path program 1 times [2024-10-11 17:58:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448415096] [2024-10-11 17:58:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448415096] [2024-10-11 17:58:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448415096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:40,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:40,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:58:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114140483] [2024-10-11 17:58:40,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:40,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:58:40,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:58:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:40,348 INFO L87 Difference]: Start difference. First operand 252 states and 280 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:40,445 INFO L93 Difference]: Finished difference Result 370 states and 410 transitions. [2024-10-11 17:58:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:58:40,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:58:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:40,446 INFO L225 Difference]: With dead ends: 370 [2024-10-11 17:58:40,446 INFO L226 Difference]: Without dead ends: 370 [2024-10-11 17:58:40,446 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-10-11 17:58:40,447 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 126 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:40,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 926 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-11 17:58:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 312. [2024-10-11 17:58:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 200 states have (on average 2.02) internal successors, (404), 311 states have internal predecessors, (404), 0 states have call successors, (0), 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-10-11 17:58:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 404 transitions. [2024-10-11 17:58:40,451 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 404 transitions. Word has length 14 [2024-10-11 17:58:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:40,451 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 404 transitions. [2024-10-11 17:58:40,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 404 transitions. [2024-10-11 17:58:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:58:40,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:40,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:40,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:58:40,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:40,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1038698037, now seen corresponding path program 1 times [2024-10-11 17:58:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:40,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664925454] [2024-10-11 17:58:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664925454] [2024-10-11 17:58:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664925454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:40,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:40,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:58:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221157434] [2024-10-11 17:58:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:40,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:40,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:40,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:40,489 INFO L87 Difference]: Start difference. First operand 312 states and 404 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:40,530 INFO L93 Difference]: Finished difference Result 298 states and 380 transitions. [2024-10-11 17:58:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:40,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:58:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:40,531 INFO L225 Difference]: With dead ends: 298 [2024-10-11 17:58:40,531 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 17:58:40,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-11 17:58:40,532 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:40,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:58:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 17:58:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-10-11 17:58:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 186 states have (on average 2.043010752688172) internal successors, (380), 297 states have internal predecessors, (380), 0 states have call successors, (0), 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-10-11 17:58:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 380 transitions. [2024-10-11 17:58:40,535 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 380 transitions. Word has length 14 [2024-10-11 17:58:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:40,535 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 380 transitions. [2024-10-11 17:58:40,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 380 transitions. [2024-10-11 17:58:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:58:40,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:40,536 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:40,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:58:40,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:40,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2040769848, now seen corresponding path program 1 times [2024-10-11 17:58:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:40,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939155236] [2024-10-11 17:58:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:40,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:40,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939155236] [2024-10-11 17:58:40,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939155236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:40,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:40,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:58:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412909082] [2024-10-11 17:58:40,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:40,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:58:40,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:40,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:58:40,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:58:40,696 INFO L87 Difference]: Start difference. First operand 298 states and 380 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:41,125 INFO L93 Difference]: Finished difference Result 316 states and 400 transitions. [2024-10-11 17:58:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:58:41,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:58:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:41,126 INFO L225 Difference]: With dead ends: 316 [2024-10-11 17:58:41,129 INFO L226 Difference]: Without dead ends: 316 [2024-10-11 17:58:41,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:58:41,130 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 75 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:41,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 581 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:58:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-11 17:58:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 300. [2024-10-11 17:58:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 190 states have (on average 2.026315789473684) internal successors, (385), 299 states have internal predecessors, (385), 0 states have call successors, (0), 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-10-11 17:58:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 385 transitions. [2024-10-11 17:58:41,137 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 385 transitions. Word has length 15 [2024-10-11 17:58:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:41,137 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 385 transitions. [2024-10-11 17:58:41,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 385 transitions. [2024-10-11 17:58:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:58:41,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:41,138 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:41,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:58:41,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:41,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2040769849, now seen corresponding path program 1 times [2024-10-11 17:58:41,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:41,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296624651] [2024-10-11 17:58:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:41,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296624651] [2024-10-11 17:58:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296624651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:58:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524165657] [2024-10-11 17:58:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:58:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:58:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:41,368 INFO L87 Difference]: Start difference. First operand 300 states and 385 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:41,729 INFO L93 Difference]: Finished difference Result 305 states and 390 transitions. [2024-10-11 17:58:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:58:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:58:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:41,730 INFO L225 Difference]: With dead ends: 305 [2024-10-11 17:58:41,730 INFO L226 Difference]: Without dead ends: 305 [2024-10-11 17:58:41,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:58:41,731 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 60 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:41,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 617 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:58:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-10-11 17:58:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2024-10-11 17:58:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 190 states have (on average 2.0210526315789474) internal successors, (384), 298 states have internal predecessors, (384), 0 states have call successors, (0), 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-10-11 17:58:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 384 transitions. [2024-10-11 17:58:41,736 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 384 transitions. Word has length 15 [2024-10-11 17:58:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:41,736 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 384 transitions. [2024-10-11 17:58:41,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 384 transitions. [2024-10-11 17:58:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:58:41,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:41,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:58:41,737 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1565388480, now seen corresponding path program 1 times [2024-10-11 17:58:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553822431] [2024-10-11 17:58:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:41,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:41,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553822431] [2024-10-11 17:58:41,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553822431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:41,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327970308] [2024-10-11 17:58:41,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:41,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:41,770 INFO L87 Difference]: Start difference. First operand 299 states and 384 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-10-11 17:58:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:41,913 INFO L93 Difference]: Finished difference Result 283 states and 352 transitions. [2024-10-11 17:58:41,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:41,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:58:41,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:41,915 INFO L225 Difference]: With dead ends: 283 [2024-10-11 17:58:41,915 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 17:58:41,915 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-10-11 17:58:41,915 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 58 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:41,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 270 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 17:58:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-11 17:58:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 190 states have (on average 1.8526315789473684) internal successors, (352), 282 states have internal predecessors, (352), 0 states have call successors, (0), 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-10-11 17:58:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 352 transitions. [2024-10-11 17:58:41,920 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 352 transitions. Word has length 16 [2024-10-11 17:58:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:41,920 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 352 transitions. [2024-10-11 17:58:41,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-10-11 17:58:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 352 transitions. [2024-10-11 17:58:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:58:41,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:41,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:41,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:58:41,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:41,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:41,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1565388481, now seen corresponding path program 1 times [2024-10-11 17:58:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:41,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53209892] [2024-10-11 17:58:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53209892] [2024-10-11 17:58:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53209892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:41,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:41,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:58:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123679975] [2024-10-11 17:58:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:41,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:41,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:41,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:41,961 INFO L87 Difference]: Start difference. First operand 283 states and 352 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-10-11 17:58:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:42,087 INFO L93 Difference]: Finished difference Result 267 states and 320 transitions. [2024-10-11 17:58:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:58:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:42,089 INFO L225 Difference]: With dead ends: 267 [2024-10-11 17:58:42,089 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 17:58:42,089 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-10-11 17:58:42,089 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 58 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:42,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 278 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 17:58:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-11 17:58:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 190 states have (on average 1.6842105263157894) internal successors, (320), 266 states have internal predecessors, (320), 0 states have call successors, (0), 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-10-11 17:58:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 320 transitions. [2024-10-11 17:58:42,093 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 320 transitions. Word has length 16 [2024-10-11 17:58:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:42,094 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 320 transitions. [2024-10-11 17:58:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-10-11 17:58:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 320 transitions. [2024-10-11 17:58:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:58:42,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:42,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:58:42,095 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1099785281, now seen corresponding path program 1 times [2024-10-11 17:58:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387155852] [2024-10-11 17:58:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387155852] [2024-10-11 17:58:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387155852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:42,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:58:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139762835] [2024-10-11 17:58:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:42,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:58:42,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:42,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:58:42,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:42,146 INFO L87 Difference]: Start difference. First operand 267 states and 320 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:42,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:42,241 INFO L93 Difference]: Finished difference Result 283 states and 321 transitions. [2024-10-11 17:58:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:58:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:58:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:42,242 INFO L225 Difference]: With dead ends: 283 [2024-10-11 17:58:42,242 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 17:58:42,242 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-10-11 17:58:42,243 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 60 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:42,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 785 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 17:58:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 265. [2024-10-11 17:58:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.675531914893617) internal successors, (315), 264 states have internal predecessors, (315), 0 states have call successors, (0), 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-10-11 17:58:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 315 transitions. [2024-10-11 17:58:42,246 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 315 transitions. Word has length 18 [2024-10-11 17:58:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:42,246 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 315 transitions. [2024-10-11 17:58:42,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 315 transitions. [2024-10-11 17:58:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:58:42,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:42,247 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:42,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:58:42,247 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:42,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2024910326, now seen corresponding path program 1 times [2024-10-11 17:58:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:42,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868683983] [2024-10-11 17:58:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:42,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868683983] [2024-10-11 17:58:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868683983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:42,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:58:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200704468] [2024-10-11 17:58:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:42,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:58:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:58:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:42,286 INFO L87 Difference]: Start difference. First operand 265 states and 315 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:42,370 INFO L93 Difference]: Finished difference Result 271 states and 320 transitions. [2024-10-11 17:58:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:58:42,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 17:58:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:42,371 INFO L225 Difference]: With dead ends: 271 [2024-10-11 17:58:42,371 INFO L226 Difference]: Without dead ends: 271 [2024-10-11 17:58:42,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:58:42,371 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 63 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:42,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 785 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-11 17:58:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2024-10-11 17:58:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.6702127659574468) internal successors, (314), 264 states have internal predecessors, (314), 0 states have call successors, (0), 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-10-11 17:58:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 314 transitions. [2024-10-11 17:58:42,374 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 314 transitions. Word has length 19 [2024-10-11 17:58:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:42,375 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 314 transitions. [2024-10-11 17:58:42,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 314 transitions. [2024-10-11 17:58:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:58:42,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:42,375 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:58:42,375 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash -995005585, now seen corresponding path program 1 times [2024-10-11 17:58:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:42,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366752883] [2024-10-11 17:58:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366752883] [2024-10-11 17:58:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366752883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:42,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:42,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:58:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19021583] [2024-10-11 17:58:42,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:42,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:58:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:58:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:58:42,621 INFO L87 Difference]: Start difference. First operand 265 states and 314 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-11 17:58:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:43,137 INFO L93 Difference]: Finished difference Result 268 states and 317 transitions. [2024-10-11 17:58:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:58:43,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-11 17:58:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:43,138 INFO L225 Difference]: With dead ends: 268 [2024-10-11 17:58:43,138 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 17:58:43,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:58:43,139 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 79 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:43,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1071 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:58:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 17:58:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2024-10-11 17:58:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 188 states have (on average 1.6648936170212767) internal successors, (313), 263 states have internal predecessors, (313), 0 states have call successors, (0), 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-10-11 17:58:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2024-10-11 17:58:43,142 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 21 [2024-10-11 17:58:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:43,142 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2024-10-11 17:58:43,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-11 17:58:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2024-10-11 17:58:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:58:43,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:43,143 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:58:43,143 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:43,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash -995005584, now seen corresponding path program 1 times [2024-10-11 17:58:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:43,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154513431] [2024-10-11 17:58:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:43,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154513431] [2024-10-11 17:58:43,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154513431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:43,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:43,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:58:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68637503] [2024-10-11 17:58:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:43,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:58:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:43,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:58:43,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:58:43,619 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-11 17:58:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:44,263 INFO L93 Difference]: Finished difference Result 267 states and 316 transitions. [2024-10-11 17:58:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:58:44,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-11 17:58:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:44,264 INFO L225 Difference]: With dead ends: 267 [2024-10-11 17:58:44,264 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 17:58:44,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:58:44,265 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 76 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:44,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1219 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:58:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 17:58:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2024-10-11 17:58:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 188 states have (on average 1.6595744680851063) internal successors, (312), 262 states have internal predecessors, (312), 0 states have call successors, (0), 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-10-11 17:58:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 312 transitions. [2024-10-11 17:58:44,268 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 312 transitions. Word has length 21 [2024-10-11 17:58:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:44,268 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 312 transitions. [2024-10-11 17:58:44,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-11 17:58:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 312 transitions. [2024-10-11 17:58:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:58:44,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:44,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:44,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:58:44,269 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:44,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1183267299, now seen corresponding path program 1 times [2024-10-11 17:58:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:44,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716814976] [2024-10-11 17:58:44,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:44,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716814976] [2024-10-11 17:58:44,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716814976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:44,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:44,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:58:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750789816] [2024-10-11 17:58:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:44,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:58:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:58:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:58:44,375 INFO L87 Difference]: Start difference. First operand 263 states and 312 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-10-11 17:58:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:44,548 INFO L93 Difference]: Finished difference Result 278 states and 315 transitions. [2024-10-11 17:58:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:58:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-11 17:58:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:44,549 INFO L225 Difference]: With dead ends: 278 [2024-10-11 17:58:44,549 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 17:58:44,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:58:44,549 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 76 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:44,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1148 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 17:58:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 250. [2024-10-11 17:58:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 175 states have (on average 1.6571428571428573) internal successors, (290), 249 states have internal predecessors, (290), 0 states have call successors, (0), 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-10-11 17:58:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 290 transitions. [2024-10-11 17:58:44,552 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 290 transitions. Word has length 22 [2024-10-11 17:58:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:44,553 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 290 transitions. [2024-10-11 17:58:44,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-10-11 17:58:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 290 transitions. [2024-10-11 17:58:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 17:58:44,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:44,553 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:44,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:58:44,553 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:44,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1234924633, now seen corresponding path program 1 times [2024-10-11 17:58:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155796678] [2024-10-11 17:58:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:44,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:44,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155796678] [2024-10-11 17:58:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155796678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:44,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:58:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515253896] [2024-10-11 17:58:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:44,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:58:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:44,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:58:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:58:44,638 INFO L87 Difference]: Start difference. First operand 250 states and 290 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-10-11 17:58:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:44,791 INFO L93 Difference]: Finished difference Result 274 states and 316 transitions. [2024-10-11 17:58:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:58:44,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-11 17:58:44,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:44,792 INFO L225 Difference]: With dead ends: 274 [2024-10-11 17:58:44,792 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 17:58:44,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:58:44,793 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 107 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:44,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1131 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 17:58:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2024-10-11 17:58:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 175 states have (on average 1.6514285714285715) internal successors, (289), 249 states have internal predecessors, (289), 0 states have call successors, (0), 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-10-11 17:58:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 289 transitions. [2024-10-11 17:58:44,796 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 289 transitions. Word has length 24 [2024-10-11 17:58:44,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:44,796 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 289 transitions. [2024-10-11 17:58:44,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-10-11 17:58:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 289 transitions. [2024-10-11 17:58:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:58:44,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:44,797 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 17:58:44,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:58:44,797 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:44,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1753016592, now seen corresponding path program 1 times [2024-10-11 17:58:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:44,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643741541] [2024-10-11 17:58:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:44,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:44,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643741541] [2024-10-11 17:58:44,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643741541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:44,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:44,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:58:44,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466411955] [2024-10-11 17:58:44,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:44,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:58:44,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:44,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:58:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:44,854 INFO L87 Difference]: Start difference. First operand 250 states and 289 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 17:58:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:45,054 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2024-10-11 17:58:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:58:45,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-11 17:58:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:45,056 INFO L225 Difference]: With dead ends: 258 [2024-10-11 17:58:45,056 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 17:58:45,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-11 17:58:45,056 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 25 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:45,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 533 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:58:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 17:58:45,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2024-10-11 17:58:45,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 173 states have (on average 1.653179190751445) internal successors, (286), 247 states have internal predecessors, (286), 0 states have call successors, (0), 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-10-11 17:58:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2024-10-11 17:58:45,059 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 25 [2024-10-11 17:58:45,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:45,060 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2024-10-11 17:58:45,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 17:58:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2024-10-11 17:58:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:58:45,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:45,060 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 17:58:45,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:58:45,060 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:45,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1753203895, now seen corresponding path program 1 times [2024-10-11 17:58:45,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:45,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707438706] [2024-10-11 17:58:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:45,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707438706] [2024-10-11 17:58:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707438706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:45,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:45,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:58:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054204880] [2024-10-11 17:58:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:58:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:58:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:58:45,081 INFO L87 Difference]: Start difference. First operand 248 states and 286 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 17:58:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:45,148 INFO L93 Difference]: Finished difference Result 234 states and 262 transitions. [2024-10-11 17:58:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:58:45,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-11 17:58:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:45,149 INFO L225 Difference]: With dead ends: 234 [2024-10-11 17:58:45,149 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 17:58:45,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-11 17:58:45,150 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:45,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 17:58:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-11 17:58:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 141 states have (on average 1.7304964539007093) internal successors, (244), 215 states have internal predecessors, (244), 0 states have call successors, (0), 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-10-11 17:58:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 244 transitions. [2024-10-11 17:58:45,153 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 244 transitions. Word has length 25 [2024-10-11 17:58:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:45,154 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 244 transitions. [2024-10-11 17:58:45,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 17:58:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 244 transitions. [2024-10-11 17:58:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:58:45,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:45,155 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:45,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:58:45,155 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:45,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:45,155 INFO L85 PathProgramCache]: Analyzing trace with hash -298493319, now seen corresponding path program 1 times [2024-10-11 17:58:45,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:45,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837527445] [2024-10-11 17:58:45,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:58:45,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:45,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837527445] [2024-10-11 17:58:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837527445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:45,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:58:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926479118] [2024-10-11 17:58:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:45,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:58:45,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:45,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:58:45,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:45,277 INFO L87 Difference]: Start difference. First operand 216 states and 244 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-10-11 17:58:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:45,496 INFO L93 Difference]: Finished difference Result 233 states and 264 transitions. [2024-10-11 17:58:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:58:45,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 25 [2024-10-11 17:58:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:45,497 INFO L225 Difference]: With dead ends: 233 [2024-10-11 17:58:45,497 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 17:58:45,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-10-11 17:58:45,498 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 21 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:45,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 583 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:58:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 17:58:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2024-10-11 17:58:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 141 states have (on average 1.7234042553191489) internal successors, (243), 214 states have internal predecessors, (243), 0 states have call successors, (0), 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-10-11 17:58:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 243 transitions. [2024-10-11 17:58:45,501 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 243 transitions. Word has length 25 [2024-10-11 17:58:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:45,501 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 243 transitions. [2024-10-11 17:58:45,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-10-11 17:58:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 243 transitions. [2024-10-11 17:58:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:58:45,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:45,502 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:45,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:58:45,503 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:45,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash -298493318, now seen corresponding path program 1 times [2024-10-11 17:58:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:45,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126970446] [2024-10-11 17:58:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:45,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126970446] [2024-10-11 17:58:45,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126970446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:45,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:58:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413298693] [2024-10-11 17:58:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:45,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:58:45,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:58:45,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:58:45,773 INFO L87 Difference]: Start difference. First operand 215 states and 243 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 17:58:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:46,241 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2024-10-11 17:58:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:58:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-11 17:58:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:46,245 INFO L225 Difference]: With dead ends: 238 [2024-10-11 17:58:46,245 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 17:58:46,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:58:46,246 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 96 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:46,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 698 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:58:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 17:58:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2024-10-11 17:58:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 141 states have (on average 1.7163120567375887) internal successors, (242), 213 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 17:58:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 242 transitions. [2024-10-11 17:58:46,251 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 242 transitions. Word has length 25 [2024-10-11 17:58:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:46,251 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 242 transitions. [2024-10-11 17:58:46,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-11 17:58:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 242 transitions. [2024-10-11 17:58:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:58:46,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:46,252 INFO L215 NwaCegarLoop]: trace histogram [2, 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-10-11 17:58:46,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:58:46,252 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:46,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1961033663, now seen corresponding path program 1 times [2024-10-11 17:58:46,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:46,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553024303] [2024-10-11 17:58:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:46,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553024303] [2024-10-11 17:58:46,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553024303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:46,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:58:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552653851] [2024-10-11 17:58:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:46,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:58:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:58:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:58:46,411 INFO L87 Difference]: Start difference. First operand 214 states and 242 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:46,703 INFO L93 Difference]: Finished difference Result 217 states and 245 transitions. [2024-10-11 17:58:46,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:58:46,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 17:58:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:46,704 INFO L225 Difference]: With dead ends: 217 [2024-10-11 17:58:46,704 INFO L226 Difference]: Without dead ends: 217 [2024-10-11 17:58:46,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:58:46,705 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 67 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:46,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1575 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:58:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-11 17:58:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2024-10-11 17:58:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 214 states have internal predecessors, (243), 0 states have call successors, (0), 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-10-11 17:58:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 243 transitions. [2024-10-11 17:58:46,709 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 243 transitions. Word has length 29 [2024-10-11 17:58:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:46,709 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 243 transitions. [2024-10-11 17:58:46,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 243 transitions. [2024-10-11 17:58:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:58:46,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:46,710 INFO L215 NwaCegarLoop]: trace histogram [2, 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-10-11 17:58:46,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:58:46,710 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:46,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1960834694, now seen corresponding path program 1 times [2024-10-11 17:58:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700104607] [2024-10-11 17:58:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:47,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700104607] [2024-10-11 17:58:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700104607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:47,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:47,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 17:58:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023534028] [2024-10-11 17:58:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:58:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:58:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:58:47,184 INFO L87 Difference]: Start difference. First operand 215 states and 243 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:47,575 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2024-10-11 17:58:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:58:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 17:58:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:47,576 INFO L225 Difference]: With dead ends: 217 [2024-10-11 17:58:47,576 INFO L226 Difference]: Without dead ends: 217 [2024-10-11 17:58:47,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:58:47,577 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 68 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:47,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1547 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:58:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-11 17:58:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2024-10-11 17:58:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 142 states have (on average 1.704225352112676) internal successors, (242), 214 states have internal predecessors, (242), 0 states have call successors, (0), 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-10-11 17:58:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 242 transitions. [2024-10-11 17:58:47,583 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 242 transitions. Word has length 29 [2024-10-11 17:58:47,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:47,583 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 242 transitions. [2024-10-11 17:58:47,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 242 transitions. [2024-10-11 17:58:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:58:47,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:47,584 INFO L215 NwaCegarLoop]: trace histogram [2, 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-10-11 17:58:47,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:58:47,584 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:47,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -960675775, now seen corresponding path program 1 times [2024-10-11 17:58:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:47,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753382983] [2024-10-11 17:58:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753382983] [2024-10-11 17:58:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753382983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:58:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653786972] [2024-10-11 17:58:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:48,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:58:48,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:58:48,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:58:48,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:58:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:48,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 17:58:48,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:58:48,323 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 13 treesize of output 9 [2024-10-11 17:58:48,328 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 13 treesize of output 9 [2024-10-11 17:58:48,404 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-10-11 17:58:48,412 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-10-11 17:58:48,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 34 [2024-10-11 17:58:48,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-10-11 17:58:48,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 34 [2024-10-11 17:58:48,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-10-11 17:58:48,543 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 42 treesize of output 30 [2024-10-11 17:58:48,592 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 13 treesize of output 3 [2024-10-11 17:58:48,598 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 13 treesize of output 3 [2024-10-11 17:58:48,610 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-10-11 17:58:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:48,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:58:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653786972] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:58:48,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:58:48,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 16 [2024-10-11 17:58:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692773647] [2024-10-11 17:58:48,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:58:48,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 17:58:48,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 17:58:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:58:48,753 INFO L87 Difference]: Start difference. First operand 215 states and 242 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-11 17:58:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:49,195 INFO L93 Difference]: Finished difference Result 269 states and 301 transitions. [2024-10-11 17:58:49,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:58:49,196 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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 29 [2024-10-11 17:58:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:49,196 INFO L225 Difference]: With dead ends: 269 [2024-10-11 17:58:49,196 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 17:58:49,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:58:49,197 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 98 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:49,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2106 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:58:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 17:58:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 239. [2024-10-11 17:58:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 166 states have (on average 1.608433734939759) internal successors, (267), 238 states have internal predecessors, (267), 0 states have call successors, (0), 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-10-11 17:58:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2024-10-11 17:58:49,200 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 29 [2024-10-11 17:58:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:49,201 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2024-10-11 17:58:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-11 17:58:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2024-10-11 17:58:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 17:58:49,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:49,202 INFO L215 NwaCegarLoop]: trace histogram [2, 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-10-11 17:58:49,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:58:49,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 17:58:49,406 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:49,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1783303702, now seen corresponding path program 1 times [2024-10-11 17:58:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924931812] [2024-10-11 17:58:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:58:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924931812] [2024-10-11 17:58:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924931812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:49,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:58:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913032037] [2024-10-11 17:58:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:49,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:58:49,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:49,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:58:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:58:49,545 INFO L87 Difference]: Start difference. First operand 239 states and 267 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-10-11 17:58:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:49,637 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2024-10-11 17:58:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:58:49,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 34 [2024-10-11 17:58:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:49,639 INFO L225 Difference]: With dead ends: 246 [2024-10-11 17:58:49,639 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 17:58:49,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-11 17:58:49,640 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 3 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:49,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:58:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 17:58:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2024-10-11 17:58:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 171 states have (on average 1.590643274853801) internal successors, (272), 243 states have internal predecessors, (272), 0 states have call successors, (0), 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-10-11 17:58:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 272 transitions. [2024-10-11 17:58:49,643 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 272 transitions. Word has length 34 [2024-10-11 17:58:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:49,643 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 272 transitions. [2024-10-11 17:58:49,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-10-11 17:58:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 272 transitions. [2024-10-11 17:58:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 17:58:49,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:49,644 INFO L215 NwaCegarLoop]: trace histogram [2, 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-10-11 17:58:49,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:58:49,644 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1911285130, now seen corresponding path program 1 times [2024-10-11 17:58:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950055436] [2024-10-11 17:58:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:58:49,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950055436] [2024-10-11 17:58:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950055436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:49,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:49,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:58:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001345685] [2024-10-11 17:58:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:49,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:58:49,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:58:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:58:49,795 INFO L87 Difference]: Start difference. First operand 244 states and 272 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:50,133 INFO L93 Difference]: Finished difference Result 311 states and 350 transitions. [2024-10-11 17:58:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:58:50,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 17:58:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:50,134 INFO L225 Difference]: With dead ends: 311 [2024-10-11 17:58:50,135 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 17:58:50,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:58:50,136 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 161 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:50,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 548 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:58:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 17:58:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 247. [2024-10-11 17:58:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 246 states have internal predecessors, (279), 0 states have call successors, (0), 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-10-11 17:58:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 279 transitions. [2024-10-11 17:58:50,141 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 279 transitions. Word has length 37 [2024-10-11 17:58:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:50,141 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 279 transitions. [2024-10-11 17:58:50,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 279 transitions. [2024-10-11 17:58:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 17:58:50,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:50,141 INFO L215 NwaCegarLoop]: trace histogram [2, 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-10-11 17:58:50,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:58:50,142 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:50,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1911285131, now seen corresponding path program 1 times [2024-10-11 17:58:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928007176] [2024-10-11 17:58:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:58:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928007176] [2024-10-11 17:58:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928007176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:58:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:58:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:58:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910453393] [2024-10-11 17:58:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:58:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:58:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:58:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:58:50,397 INFO L87 Difference]: Start difference. First operand 247 states and 279 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:50,733 INFO L93 Difference]: Finished difference Result 323 states and 368 transitions. [2024-10-11 17:58:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:58:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-10-11 17:58:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:50,734 INFO L225 Difference]: With dead ends: 323 [2024-10-11 17:58:50,734 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 17:58:50,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:58:50,735 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 238 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:50,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 702 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:58:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 17:58:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 303. [2024-10-11 17:58:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 232 states have (on average 1.5862068965517242) internal successors, (368), 302 states have internal predecessors, (368), 0 states have call successors, (0), 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-10-11 17:58:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2024-10-11 17:58:50,742 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 37 [2024-10-11 17:58:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:50,742 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2024-10-11 17:58:50,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:58:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2024-10-11 17:58:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 17:58:50,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:50,743 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:50,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:58:50,743 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:50,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash -257337057, now seen corresponding path program 2 times [2024-10-11 17:58:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826477666] [2024-10-11 17:58:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:51,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826477666] [2024-10-11 17:58:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826477666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:58:51,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816271866] [2024-10-11 17:58:51,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:58:51,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:58:51,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:58:51,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:58:51,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:58:51,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:58:51,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:58:51,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-11 17:58:51,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:58:51,757 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-10-11 17:58:51,780 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 17:58:51,780 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 14 treesize of output 13 [2024-10-11 17:58:51,812 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 17:58:51,813 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 18 treesize of output 17 [2024-10-11 17:58:51,855 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-10-11 17:58:51,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 32 [2024-10-11 17:58:51,929 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 17:58:51,929 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 37 treesize of output 40 [2024-10-11 17:58:51,998 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-10-11 17:58:52,004 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-10-11 17:58:52,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 17:58:52,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 75 treesize of output 54 [2024-10-11 17:58:52,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:58:52,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 82 treesize of output 42 [2024-10-11 17:58:52,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-10-11 17:58:52,396 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 7 treesize of output 3 [2024-10-11 17:58:52,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2024-10-11 17:58:52,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2024-10-11 17:58:52,556 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 17 treesize of output 9 [2024-10-11 17:58:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:52,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:58:53,077 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 44 treesize of output 40 [2024-10-11 17:58:53,082 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:58:53,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 178 [2024-10-11 17:58:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816271866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:58:53,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:58:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 41 [2024-10-11 17:58:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868166267] [2024-10-11 17:58:53,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:58:53,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 17:58:53,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:58:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 17:58:53,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1581, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 17:58:53,388 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 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-10-11 17:58:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:58:55,582 INFO L93 Difference]: Finished difference Result 342 states and 414 transitions. [2024-10-11 17:58:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 17:58:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 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 37 [2024-10-11 17:58:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:58:55,583 INFO L225 Difference]: With dead ends: 342 [2024-10-11 17:58:55,583 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 17:58:55,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=394, Invalid=3028, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 17:58:55,585 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 225 mSDsluCounter, 2535 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:58:55,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 2708 Invalid, 3156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 17:58:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 17:58:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 302. [2024-10-11 17:58:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 232 states have (on average 1.581896551724138) internal successors, (367), 301 states have internal predecessors, (367), 0 states have call successors, (0), 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-10-11 17:58:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 367 transitions. [2024-10-11 17:58:55,590 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 367 transitions. Word has length 37 [2024-10-11 17:58:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:58:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 367 transitions. [2024-10-11 17:58:55,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.048780487804878) internal successors, (84), 42 states have internal predecessors, (84), 0 states have call successors, (0), 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-10-11 17:58:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 367 transitions. [2024-10-11 17:58:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 17:58:55,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:58:55,592 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:58:55,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:58:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:58:55,797 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:58:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:58:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash -257337056, now seen corresponding path program 1 times [2024-10-11 17:58:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:58:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345400733] [2024-10-11 17:58:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:58:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:58:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345400733] [2024-10-11 17:58:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345400733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:58:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704092640] [2024-10-11 17:58:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:58:56,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:58:56,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:58:56,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:58:56,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:58:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:58:57,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-11 17:58:57,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:58:57,061 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-10-11 17:58:57,065 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 8 treesize of output 1 [2024-10-11 17:58:57,145 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 17:58:57,145 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 17 treesize of output 21 [2024-10-11 17:58:57,150 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 14 treesize of output 9 [2024-10-11 17:58:57,223 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 17:58:57,224 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 14 treesize of output 13 [2024-10-11 17:58:57,240 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 17:58:57,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 17:58:57,284 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 13 treesize of output 9 [2024-10-11 17:58:57,292 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 19 treesize of output 1 [2024-10-11 17:58:57,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:58:57,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 17:58:57,386 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-10-11 17:58:57,393 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-10-11 17:58:57,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 97 treesize of output 65 [2024-10-11 17:58:57,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2024-10-11 17:58:57,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 97 treesize of output 65 [2024-10-11 17:58:57,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2024-10-11 17:58:57,563 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 78 treesize of output 22 [2024-10-11 17:58:57,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 3 [2024-10-11 17:58:57,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-10-11 17:58:57,600 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-10-11 17:58:57,637 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 26 treesize of output 14 [2024-10-11 17:58:57,639 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 7 treesize of output 3 [2024-10-11 17:58:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:58:57,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:59:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704092640] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:59:02,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:59:02,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 39 [2024-10-11 17:59:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72384333] [2024-10-11 17:59:02,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:59:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 17:59:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:02,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 17:59:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1447, Unknown=1, NotChecked=0, Total=1560 [2024-10-11 17:59:02,456 INFO L87 Difference]: Start difference. First operand 302 states and 367 transitions. Second operand has 40 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-11 17:59:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:05,040 INFO L93 Difference]: Finished difference Result 327 states and 395 transitions. [2024-10-11 17:59:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 17:59:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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 37 [2024-10-11 17:59:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:05,041 INFO L225 Difference]: With dead ends: 327 [2024-10-11 17:59:05,041 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 17:59:05,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=383, Invalid=2808, Unknown=1, NotChecked=0, Total=3192 [2024-10-11 17:59:05,042 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 336 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 3382 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 2844 SdHoareTripleChecker+Invalid, 3400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:05,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 2844 Invalid, 3400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3382 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 17:59:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 17:59:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2024-10-11 17:59:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.5775862068965518) internal successors, (366), 300 states have internal predecessors, (366), 0 states have call successors, (0), 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-10-11 17:59:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 366 transitions. [2024-10-11 17:59:05,048 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 366 transitions. Word has length 37 [2024-10-11 17:59:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 366 transitions. [2024-10-11 17:59:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 40 states have internal predecessors, (104), 0 states have call successors, (0), 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-10-11 17:59:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 366 transitions. [2024-10-11 17:59:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 17:59:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:05,049 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2024-10-11 17:59:05,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:59:05,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:59:05,254 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:59:05,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash 844109263, now seen corresponding path program 1 times [2024-10-11 17:59:05,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:05,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486069379] [2024-10-11 17:59:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:59:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:05,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486069379] [2024-10-11 17:59:05,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486069379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:05,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:05,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:59:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744340679] [2024-10-11 17:59:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:05,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:59:05,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:05,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:59:05,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:59:05,318 INFO L87 Difference]: Start difference. First operand 301 states and 366 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:05,447 INFO L93 Difference]: Finished difference Result 368 states and 422 transitions. [2024-10-11 17:59:05,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:59:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-11 17:59:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:05,449 INFO L225 Difference]: With dead ends: 368 [2024-10-11 17:59:05,449 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 17:59:05,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:59:05,449 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 165 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:05,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 859 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:59:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 17:59:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 300. [2024-10-11 17:59:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 231 states have (on average 1.567099567099567) internal successors, (362), 299 states have internal predecessors, (362), 0 states have call successors, (0), 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-10-11 17:59:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 362 transitions. [2024-10-11 17:59:05,455 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 362 transitions. Word has length 41 [2024-10-11 17:59:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:05,455 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 362 transitions. [2024-10-11 17:59:05,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 362 transitions. [2024-10-11 17:59:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 17:59:05,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:05,456 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2024-10-11 17:59:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:59:05,456 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:59:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash -271442072, now seen corresponding path program 1 times [2024-10-11 17:59:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961710845] [2024-10-11 17:59:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:59:05,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961710845] [2024-10-11 17:59:05,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961710845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:05,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:05,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:59:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270142388] [2024-10-11 17:59:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:05,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:59:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:05,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:59:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:59:05,884 INFO L87 Difference]: Start difference. First operand 300 states and 362 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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-10-11 17:59:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:06,518 INFO L93 Difference]: Finished difference Result 364 states and 413 transitions. [2024-10-11 17:59:06,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:59:06,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-11 17:59:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:06,519 INFO L225 Difference]: With dead ends: 364 [2024-10-11 17:59:06,520 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 17:59:06,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:59:06,520 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 325 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:06,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 868 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 17:59:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 17:59:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 321. [2024-10-11 17:59:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 252 states have (on average 1.6388888888888888) internal successors, (413), 320 states have internal predecessors, (413), 0 states have call successors, (0), 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-10-11 17:59:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 413 transitions. [2024-10-11 17:59:06,524 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 413 transitions. Word has length 42 [2024-10-11 17:59:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:06,524 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 413 transitions. [2024-10-11 17:59:06,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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-10-11 17:59:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 413 transitions. [2024-10-11 17:59:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 17:59:06,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:06,524 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2024-10-11 17:59:06,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 17:59:06,525 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:59:06,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash -269827757, now seen corresponding path program 1 times [2024-10-11 17:59:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072176551] [2024-10-11 17:59:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:59:06,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072176551] [2024-10-11 17:59:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072176551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:59:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351116050] [2024-10-11 17:59:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:59:06,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:06,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:59:06,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:06,633 INFO L87 Difference]: Start difference. First operand 321 states and 413 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:06,802 INFO L93 Difference]: Finished difference Result 325 states and 418 transitions. [2024-10-11 17:59:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:59:06,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-11 17:59:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:06,803 INFO L225 Difference]: With dead ends: 325 [2024-10-11 17:59:06,803 INFO L226 Difference]: Without dead ends: 325 [2024-10-11 17:59:06,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:59:06,803 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 51 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:06,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 347 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:59:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-11 17:59:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-10-11 17:59:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 256 states have (on average 1.6328125) internal successors, (418), 324 states have internal predecessors, (418), 0 states have call successors, (0), 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-10-11 17:59:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 418 transitions. [2024-10-11 17:59:06,807 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 418 transitions. Word has length 42 [2024-10-11 17:59:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:06,807 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 418 transitions. [2024-10-11 17:59:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:59:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 418 transitions. [2024-10-11 17:59:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 17:59:06,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:06,807 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2024-10-11 17:59:06,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:59:06,807 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:59:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash -269827756, now seen corresponding path program 1 times [2024-10-11 17:59:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:06,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610470040] [2024-10-11 17:59:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:06,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:59:07,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:07,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610470040] [2024-10-11 17:59:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610470040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:59:07,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:59:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:59:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454428753] [2024-10-11 17:59:07,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:59:07,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 17:59:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:07,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 17:59:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:59:07,135 INFO L87 Difference]: Start difference. First operand 325 states and 418 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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-10-11 17:59:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:07,633 INFO L93 Difference]: Finished difference Result 367 states and 417 transitions. [2024-10-11 17:59:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:59:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-11 17:59:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:07,635 INFO L225 Difference]: With dead ends: 367 [2024-10-11 17:59:07,635 INFO L226 Difference]: Without dead ends: 367 [2024-10-11 17:59:07,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:59:07,635 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 229 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:07,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 801 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:59:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-11 17:59:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 325. [2024-10-11 17:59:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 256 states have (on average 1.62890625) internal successors, (417), 324 states have internal predecessors, (417), 0 states have call successors, (0), 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-10-11 17:59:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 417 transitions. [2024-10-11 17:59:07,641 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 417 transitions. Word has length 42 [2024-10-11 17:59:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:07,641 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 417 transitions. [2024-10-11 17:59:07,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 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-10-11 17:59:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 417 transitions. [2024-10-11 17:59:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:59:07,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:07,642 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2024-10-11 17:59:07,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 17:59:07,642 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:59:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 175239695, now seen corresponding path program 1 times [2024-10-11 17:59:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806346107] [2024-10-11 17:59:07,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:59:07,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806346107] [2024-10-11 17:59:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806346107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:59:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087702072] [2024-10-11 17:59:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:07,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:59:07,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:59:07,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:59:07,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:59:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:08,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:59:08,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:59:08,125 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 13 treesize of output 9 [2024-10-11 17:59:08,128 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 13 treesize of output 9 [2024-10-11 17:59:08,166 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-10-11 17:59:08,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 17:59:08,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 17:59:08,239 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 7 treesize of output 3 [2024-10-11 17:59:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:59:08,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:59:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:59:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087702072] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:59:08,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:59:08,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2024-10-11 17:59:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506161812] [2024-10-11 17:59:08,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:59:08,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:59:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:08,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:59:08,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:59:08,457 INFO L87 Difference]: Start difference. First operand 325 states and 417 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-10-11 17:59:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:08,906 INFO L93 Difference]: Finished difference Result 406 states and 509 transitions. [2024-10-11 17:59:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:59:08,906 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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 43 [2024-10-11 17:59:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:08,910 INFO L225 Difference]: With dead ends: 406 [2024-10-11 17:59:08,910 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 17:59:08,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:59:08,911 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 79 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:08,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 2120 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:59:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 17:59:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 336. [2024-10-11 17:59:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 267 states have (on average 1.6029962546816479) internal successors, (428), 335 states have internal predecessors, (428), 0 states have call successors, (0), 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-10-11 17:59:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 428 transitions. [2024-10-11 17:59:08,918 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 428 transitions. Word has length 43 [2024-10-11 17:59:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:08,918 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 428 transitions. [2024-10-11 17:59:08,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 0 states have call successors, (0), 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-10-11 17:59:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 428 transitions. [2024-10-11 17:59:08,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:59:08,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:08,918 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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-10-11 17:59:08,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:59:09,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 17:59:09,119 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:59:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:09,120 INFO L85 PathProgramCache]: Analyzing trace with hash 990778795, now seen corresponding path program 1 times [2024-10-11 17:59:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120948780] [2024-10-11 17:59:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120948780] [2024-10-11 17:59:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120948780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:59:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074187601] [2024-10-11 17:59:10,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:59:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:59:10,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:59:10,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:59:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:10,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-11 17:59:10,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:59:10,759 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-10-11 17:59:10,803 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 17:59:10,804 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 17 treesize of output 21 [2024-10-11 17:59:10,851 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-10-11 17:59:10,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 22 [2024-10-11 17:59:10,959 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-10-11 17:59:10,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-10-11 17:59:11,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 32 [2024-10-11 17:59:11,052 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-10-11 17:59:11,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-10-11 17:59:11,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2024-10-11 17:59:11,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2024-10-11 17:59:11,211 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 17:59:11,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 53 [2024-10-11 17:59:11,222 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-10-11 17:59:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:59:11,321 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 17:59:11,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 37 [2024-10-11 17:59:11,388 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-10-11 17:59:11,394 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-10-11 17:59:11,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 127 [2024-10-11 17:59:11,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-10-11 17:59:11,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:11,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 204 treesize of output 124 [2024-10-11 17:59:11,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-10-11 17:59:12,170 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 23 treesize of output 7 [2024-10-11 17:59:12,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 123 [2024-10-11 17:59:12,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-11 17:59:12,701 INFO L349 Elim1Store]: treesize reduction 32, result has 69.5 percent of original size [2024-10-11 17:59:12,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 225 treesize of output 171 [2024-10-11 17:59:13,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 139 [2024-10-11 17:59:13,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 11 [2024-10-11 17:59:13,715 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 7 treesize of output 3 [2024-10-11 17:59:13,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:13,859 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 179 treesize of output 91 [2024-10-11 17:59:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:13,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:59:15,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:15,707 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 54 [2024-10-11 17:59:15,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:15,717 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 478 treesize of output 468 [2024-10-11 17:59:15,728 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 354 treesize of output 346 [2024-10-11 17:59:15,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:15,781 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 293 treesize of output 293 [2024-10-11 17:59:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074187601] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:59:26,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:59:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 22] total 67 [2024-10-11 17:59:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298707317] [2024-10-11 17:59:26,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:59:26,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-11 17:59:26,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:59:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-11 17:59:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=4313, Unknown=4, NotChecked=0, Total=4556 [2024-10-11 17:59:26,930 INFO L87 Difference]: Start difference. First operand 336 states and 428 transitions. Second operand has 68 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 68 states have internal predecessors, (129), 0 states have call successors, (0), 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-10-11 17:59:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:59:35,595 INFO L93 Difference]: Finished difference Result 364 states and 460 transitions. [2024-10-11 17:59:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 17:59:35,595 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 68 states have internal predecessors, (129), 0 states have call successors, (0), 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 45 [2024-10-11 17:59:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:59:35,596 INFO L225 Difference]: With dead ends: 364 [2024-10-11 17:59:35,596 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 17:59:35,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=784, Invalid=8332, Unknown=4, NotChecked=0, Total=9120 [2024-10-11 17:59:35,598 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 530 mSDsluCounter, 5053 mSDsCounter, 0 mSdLazyCounter, 6789 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 5230 SdHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:59:35,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 5230 Invalid, 6823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 6789 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 17:59:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 17:59:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 340. [2024-10-11 17:59:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 271 states have (on average 1.6014760147601477) internal successors, (434), 339 states have internal predecessors, (434), 0 states have call successors, (0), 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-10-11 17:59:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 434 transitions. [2024-10-11 17:59:35,610 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 434 transitions. Word has length 45 [2024-10-11 17:59:35,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:59:35,611 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 434 transitions. [2024-10-11 17:59:35,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 68 states have internal predecessors, (129), 0 states have call successors, (0), 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-10-11 17:59:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 434 transitions. [2024-10-11 17:59:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 17:59:35,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:59:35,611 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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-10-11 17:59:35,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:59:35,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-11 17:59:35,812 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-10-11 17:59:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:59:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash 990778796, now seen corresponding path program 1 times [2024-10-11 17:59:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:59:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337207994] [2024-10-11 17:59:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:59:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:59:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337207994] [2024-10-11 17:59:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337207994] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:59:37,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616570794] [2024-10-11 17:59:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:59:37,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:59:37,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:59:37,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:59:37,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:59:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:59:37,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-10-11 17:59:37,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:59:37,779 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-10-11 17:59:37,783 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 8 treesize of output 1 [2024-10-11 17:59:37,837 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 17:59:37,837 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 14 treesize of output 13 [2024-10-11 17:59:37,852 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 17:59:37,852 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 17 treesize of output 21 [2024-10-11 17:59:37,913 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-10-11 17:59:37,922 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-10-11 17:59:37,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 51 treesize of output 27 [2024-10-11 17:59:38,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-10-11 17:59:38,077 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 17:59:38,078 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 18 treesize of output 21 [2024-10-11 17:59:38,105 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-10-11 17:59:38,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-10-11 17:59:38,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-11 17:59:38,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 39 [2024-10-11 17:59:38,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-11 17:59:38,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 39 [2024-10-11 17:59:38,218 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 17:59:38,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-11 17:59:38,240 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 17:59:38,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 17:59:38,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 17:59:38,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2024-10-11 17:59:38,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 59 [2024-10-11 17:59:38,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-11 17:59:38,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:59:38,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-11 17:59:38,618 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-10-11 17:59:38,633 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-10-11 17:59:38,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 258 treesize of output 201 [2024-10-11 17:59:38,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 280 treesize of output 212 [2024-10-11 17:59:39,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 195 [2024-10-11 17:59:39,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 195 [2024-10-11 17:59:39,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 222 [2024-10-11 17:59:39,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 244 treesize of output 165 [2024-10-11 17:59:39,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:59:39,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:59:39,689 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-10-11 17:59:39,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 54 [2024-10-11 17:59:39,702 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-10-11 17:59:39,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2024-10-11 17:59:39,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 20 [2024-10-11 17:59:39,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-10-11 17:59:39,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2024-10-11 17:59:39,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:39,976 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 7 [2024-10-11 17:59:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:59:40,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:59:41,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:41,298 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 17:59:41,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:41,310 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2024-10-11 17:59:51,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,041 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-10-11 17:59:51,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,052 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 68 treesize of output 68 [2024-10-11 17:59:51,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,065 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 70 treesize of output 68 [2024-10-11 17:59:51,071 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-10-11 17:59:51,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,808 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 81 [2024-10-11 17:59:51,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,821 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 668 treesize of output 664 [2024-10-11 17:59:51,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,837 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 430 treesize of output 344 [2024-10-11 17:59:51,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,857 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 1102 treesize of output 1074 [2024-10-11 17:59:51,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:51,882 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 272 treesize of output 266 [2024-10-11 17:59:51,893 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 626 treesize of output 614 [2024-10-11 17:59:51,908 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 338 treesize of output 334 [2024-10-11 17:59:52,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:59:52,429 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 421 treesize of output 421