./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 fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:38:55,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:38:55,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:38:55,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:38:55,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:38:55,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:38:55,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:38:55,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:38:55,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:38:55,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:38:55,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:38:55,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:38:55,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:38:55,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:38:55,776 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:38:55,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:38:55,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:38:55,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:38:55,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:38:55,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:38:55,778 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:38:55,781 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:38:55,782 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:38:55,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:38:55,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:38:55,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:38:55,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:38:55,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:38:55,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:38:55,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:38:55,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:38:55,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:38:55,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:38:55,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:38:55,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:38:55,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:38:55,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:38:55,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:38:55,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:38:55,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:38:55,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:38:55,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:38:55,787 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2024-11-20 14:38:56,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:38:56,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:38:56,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:38:56,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:38:56,087 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:38:56,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2024-11-20 14:38:57,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:38:57,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:38:57,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2024-11-20 14:38:57,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98432875/a8a6797ed25246959f079c95de1f9765/FLAGfeea59044 [2024-11-20 14:38:57,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98432875/a8a6797ed25246959f079c95de1f9765 [2024-11-20 14:38:57,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:38:57,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:38:57,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:38:57,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:38:57,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:38:57,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:38:57" (1/1) ... [2024-11-20 14:38:57,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630c91d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:57, skipping insertion in model container [2024-11-20 14:38:57,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:38:57" (1/1) ... [2024-11-20 14:38:57,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:38:58,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:38:58,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:38:58,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:38:58,313 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:38:58,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58 WrapperNode [2024-11-20 14:38:58,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:38:58,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:38:58,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:38:58,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:38:58,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,373 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 313 [2024-11-20 14:38:58,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:38:58,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:38:58,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:38:58,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:38:58,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,434 INFO L175 MemorySlicer]: Split 76 memory accesses to 6 slices as follows [2, 16, 31, 3, 16, 8]. 41 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 0, 0, 1, 0, 2]. The 26 writes are split as follows [0, 8, 8, 1, 8, 1]. [2024-11-20 14:38:58,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:38:58,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:38:58,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:38:58,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:38:58,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (1/1) ... [2024-11-20 14:38:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:38:58,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:38:58,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:38:58,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:38:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:38:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:38:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 14:38:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 14:38:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 14:38:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 14:38:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:38:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:38:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:38:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:38:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:38:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:38:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 14:38:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-20 14:38:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-20 14:38:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:38:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:38:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-20 14:38:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 14:38:58,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:38:58,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:38:58,761 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:38:58,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:38:59,566 INFO L? ?]: Removed 337 outVars from TransFormulas that were not future-live. [2024-11-20 14:38:59,566 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:38:59,588 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:38:59,588 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-20 14:38:59,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:38:59 BoogieIcfgContainer [2024-11-20 14:38:59,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:38:59,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:38:59,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:38:59,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:38:59,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:38:57" (1/3) ... [2024-11-20 14:38:59,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1486c682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:38:59, skipping insertion in model container [2024-11-20 14:38:59,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:38:58" (2/3) ... [2024-11-20 14:38:59,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1486c682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:38:59, skipping insertion in model container [2024-11-20 14:38:59,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:38:59" (3/3) ... [2024-11-20 14:38:59,599 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0521.i [2024-11-20 14:38:59,615 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:38:59,615 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2024-11-20 14:38:59,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:38:59,673 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;@217d39d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:38:59,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2024-11-20 14:38:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 159 states have (on average 2.1949685534591197) internal successors, (349), 311 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:38:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 14:38:59,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:38:59,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 14:38:59,683 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-11-20 14:38:59,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:38:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 28729512, now seen corresponding path program 1 times [2024-11-20 14:38:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:38:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881887889] [2024-11-20 14:38:59,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:38:59,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:38:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:38:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:38:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:38:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881887889] [2024-11-20 14:38:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881887889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:38:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:38:59,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:38:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102092085] [2024-11-20 14:38:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:38:59,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 14:38:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:38:59,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 14:38:59,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:38:59,877 INFO L87 Difference]: Start difference. First operand has 312 states, 159 states have (on average 2.1949685534591197) internal successors, (349), 311 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:38:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:38:59,918 INFO L93 Difference]: Finished difference Result 312 states and 339 transitions. [2024-11-20 14:38:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 14:38:59,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 14:38:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:38:59,937 INFO L225 Difference]: With dead ends: 312 [2024-11-20 14:38:59,937 INFO L226 Difference]: Without dead ends: 310 [2024-11-20 14:38:59,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:38:59,943 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:38:59,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:38:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-20 14:38:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-20 14:38:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 158 states have (on average 2.132911392405063) internal successors, (337), 309 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 337 transitions. [2024-11-20 14:39:00,006 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 337 transitions. Word has length 5 [2024-11-20 14:39:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:00,007 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 337 transitions. [2024-11-20 14:39:00,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 337 transitions. [2024-11-20 14:39:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:39:00,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:00,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:39:00,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:39:00,009 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-11-20 14:39:00,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2024-11-20 14:39:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209712333] [2024-11-20 14:39:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:00,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209712333] [2024-11-20 14:39:00,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209712333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:00,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561629379] [2024-11-20 14:39:00,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:00,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:00,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:00,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:00,110 INFO L87 Difference]: Start difference. First operand 310 states and 337 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:00,369 INFO L93 Difference]: Finished difference Result 294 states and 321 transitions. [2024-11-20 14:39:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:39:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:00,371 INFO L225 Difference]: With dead ends: 294 [2024-11-20 14:39:00,371 INFO L226 Difference]: Without dead ends: 294 [2024-11-20 14:39:00,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:00,373 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 60 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:00,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 405 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-20 14:39:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-20 14:39:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 158 states have (on average 2.0316455696202533) internal successors, (321), 293 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 321 transitions. [2024-11-20 14:39:00,384 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 321 transitions. Word has length 6 [2024-11-20 14:39:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 321 transitions. [2024-11-20 14:39:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 321 transitions. [2024-11-20 14:39:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:39:00,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:00,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:39:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:39:00,386 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-11-20 14:39:00,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash 889570249, now seen corresponding path program 1 times [2024-11-20 14:39:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060041893] [2024-11-20 14:39:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060041893] [2024-11-20 14:39:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060041893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:00,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150653737] [2024-11-20 14:39:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:00,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:00,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:00,522 INFO L87 Difference]: Start difference. First operand 294 states and 321 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:00,752 INFO L93 Difference]: Finished difference Result 278 states and 305 transitions. [2024-11-20 14:39:00,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:00,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:39:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:00,755 INFO L225 Difference]: With dead ends: 278 [2024-11-20 14:39:00,755 INFO L226 Difference]: Without dead ends: 278 [2024-11-20 14:39:00,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:00,757 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 60 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 414 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:00,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 414 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-20 14:39:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-20 14:39:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 158 states have (on average 1.9303797468354431) internal successors, (305), 277 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 305 transitions. [2024-11-20 14:39:00,778 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 305 transitions. Word has length 6 [2024-11-20 14:39:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:00,778 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 305 transitions. [2024-11-20 14:39:00,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 305 transitions. [2024-11-20 14:39:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:39:00,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:00,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:39:00,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:39:00,779 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-11-20 14:39:00,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2024-11-20 14:39:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:00,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528020146] [2024-11-20 14:39:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:00,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:00,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528020146] [2024-11-20 14:39:00,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528020146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:00,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:00,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074191003] [2024-11-20 14:39:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:00,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:00,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:00,835 INFO L87 Difference]: Start difference. First operand 278 states and 305 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:01,036 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2024-11-20 14:39:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:39:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:01,038 INFO L225 Difference]: With dead ends: 276 [2024-11-20 14:39:01,038 INFO L226 Difference]: Without dead ends: 276 [2024-11-20 14:39:01,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:01,040 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 6 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:01,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 449 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-20 14:39:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-20 14:39:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 158 states have (on average 1.9177215189873418) internal successors, (303), 275 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 303 transitions. [2024-11-20 14:39:01,048 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 303 transitions. Word has length 6 [2024-11-20 14:39:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:01,048 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 303 transitions. [2024-11-20 14:39:01,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 303 transitions. [2024-11-20 14:39:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:39:01,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:01,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:39:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:39:01,050 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-11-20 14:39:01,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2024-11-20 14:39:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402816295] [2024-11-20 14:39:01,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:01,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:01,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402816295] [2024-11-20 14:39:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402816295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201893961] [2024-11-20 14:39:01,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:01,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:01,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:01,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:01,106 INFO L87 Difference]: Start difference. First operand 276 states and 303 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:01,275 INFO L93 Difference]: Finished difference Result 274 states and 301 transitions. [2024-11-20 14:39:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:01,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:39:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:01,277 INFO L225 Difference]: With dead ends: 274 [2024-11-20 14:39:01,277 INFO L226 Difference]: Without dead ends: 274 [2024-11-20 14:39:01,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:01,280 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 6 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:01,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 459 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-20 14:39:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-20 14:39:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 158 states have (on average 1.9050632911392404) internal successors, (301), 273 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 301 transitions. [2024-11-20 14:39:01,294 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 301 transitions. Word has length 6 [2024-11-20 14:39:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:01,295 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 301 transitions. [2024-11-20 14:39:01,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 301 transitions. [2024-11-20 14:39:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 14:39:01,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:01,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:01,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:39:01,298 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-11-20 14:39:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 178517033, now seen corresponding path program 1 times [2024-11-20 14:39:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193842623] [2024-11-20 14:39:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193842623] [2024-11-20 14:39:01,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193842623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:01,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:01,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:39:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640785281] [2024-11-20 14:39:01,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:01,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:39:01,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:01,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:39:01,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:39:01,391 INFO L87 Difference]: Start difference. First operand 274 states and 301 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-11-20 14:39:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:01,449 INFO L93 Difference]: Finished difference Result 338 states and 373 transitions. [2024-11-20 14:39:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:39:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-11-20 14:39:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:01,451 INFO L225 Difference]: With dead ends: 338 [2024-11-20 14:39:01,451 INFO L226 Difference]: Without dead ends: 338 [2024-11-20 14:39:01,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:01,452 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 68 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:01,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 867 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:39:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-20 14:39:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 279. [2024-11-20 14:39:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 163 states have (on average 1.883435582822086) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2024-11-20 14:39:01,458 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 8 [2024-11-20 14:39:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:01,458 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2024-11-20 14:39:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-11-20 14:39:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2024-11-20 14:39:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 14:39:01,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:01,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:01,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:39:01,460 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-11-20 14:39:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660206, now seen corresponding path program 1 times [2024-11-20 14:39:01,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:01,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042873863] [2024-11-20 14:39:01,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:01,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042873863] [2024-11-20 14:39:01,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042873863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:01,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:01,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705363805] [2024-11-20 14:39:01,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:01,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:01,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:01,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:01,535 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-11-20 14:39:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:01,706 INFO L93 Difference]: Finished difference Result 277 states and 305 transitions. [2024-11-20 14:39:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:01,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-11-20 14:39:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:01,709 INFO L225 Difference]: With dead ends: 277 [2024-11-20 14:39:01,709 INFO L226 Difference]: Without dead ends: 277 [2024-11-20 14:39:01,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:01,710 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:01,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 448 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-20 14:39:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-20 14:39:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 163 states have (on average 1.8711656441717792) internal successors, (305), 276 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 305 transitions. [2024-11-20 14:39:01,715 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 305 transitions. Word has length 11 [2024-11-20 14:39:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:01,715 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 305 transitions. [2024-11-20 14:39:01,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-11-20 14:39:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 305 transitions. [2024-11-20 14:39:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 14:39:01,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:01,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:01,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:39:01,717 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-11-20 14:39:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660205, now seen corresponding path program 1 times [2024-11-20 14:39:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328595573] [2024-11-20 14:39:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:01,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328595573] [2024-11-20 14:39:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328595573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:01,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736854105] [2024-11-20 14:39:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:01,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:01,804 INFO L87 Difference]: Start difference. First operand 277 states and 305 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-11-20 14:39:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:01,951 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2024-11-20 14:39:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-11-20 14:39:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:01,953 INFO L225 Difference]: With dead ends: 275 [2024-11-20 14:39:01,953 INFO L226 Difference]: Without dead ends: 275 [2024-11-20 14:39:01,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:01,954 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:01,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 458 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-20 14:39:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-20 14:39:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 163 states have (on average 1.8588957055214723) internal successors, (303), 274 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2024-11-20 14:39:01,963 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 11 [2024-11-20 14:39:01,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:01,964 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2024-11-20 14:39:01,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-11-20 14:39:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2024-11-20 14:39:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:39:01,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:01,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:01,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:39:01,966 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-11-20 14:39:01,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2146491318, now seen corresponding path program 1 times [2024-11-20 14:39:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25806709] [2024-11-20 14:39:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25806709] [2024-11-20 14:39:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25806709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:39:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363829912] [2024-11-20 14:39:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:39:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:02,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:39:02,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:39:02,163 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:02,317 INFO L93 Difference]: Finished difference Result 327 states and 362 transitions. [2024-11-20 14:39:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:39:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:39:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:02,320 INFO L225 Difference]: With dead ends: 327 [2024-11-20 14:39:02,320 INFO L226 Difference]: Without dead ends: 327 [2024-11-20 14:39:02,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:39:02,321 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 80 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:02,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1414 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-20 14:39:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 278. [2024-11-20 14:39:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 166 states have (on average 1.8433734939759037) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2024-11-20 14:39:02,329 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 13 [2024-11-20 14:39:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:02,329 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2024-11-20 14:39:02,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2024-11-20 14:39:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 14:39:02,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:02,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:02,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:39:02,330 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-11-20 14:39:02,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1184070605, now seen corresponding path program 1 times [2024-11-20 14:39:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105413223] [2024-11-20 14:39:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105413223] [2024-11-20 14:39:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105413223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:02,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:39:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140901337] [2024-11-20 14:39:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:02,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:02,424 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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-11-20 14:39:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:02,514 INFO L93 Difference]: Finished difference Result 401 states and 441 transitions. [2024-11-20 14:39:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:39:02,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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-11-20 14:39:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:02,516 INFO L225 Difference]: With dead ends: 401 [2024-11-20 14:39:02,517 INFO L226 Difference]: Without dead ends: 401 [2024-11-20 14:39:02,517 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-11-20 14:39:02,518 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 131 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:02,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1115 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-20 14:39:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2024-11-20 14:39:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 229 states have (on average 1.8908296943231442) internal successors, (433), 340 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 433 transitions. [2024-11-20 14:39:02,528 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 433 transitions. Word has length 15 [2024-11-20 14:39:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 433 transitions. [2024-11-20 14:39:02,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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-11-20 14:39:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 433 transitions. [2024-11-20 14:39:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:39:02,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:02,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:02,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:39:02,529 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-11-20 14:39:02,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1942731278, now seen corresponding path program 1 times [2024-11-20 14:39:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791890165] [2024-11-20 14:39:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791890165] [2024-11-20 14:39:02,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791890165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:02,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:02,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:39:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448408513] [2024-11-20 14:39:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:02,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:02,572 INFO L87 Difference]: Start difference. First operand 341 states and 433 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) 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-11-20 14:39:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:02,586 INFO L93 Difference]: Finished difference Result 326 states and 408 transitions. [2024-11-20 14:39:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:02,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-11-20 14:39:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:02,588 INFO L225 Difference]: With dead ends: 326 [2024-11-20 14:39:02,588 INFO L226 Difference]: Without dead ends: 326 [2024-11-20 14:39:02,588 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-11-20 14:39:02,589 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:02,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:39:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-20 14:39:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-20 14:39:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 214 states have (on average 1.9065420560747663) internal successors, (408), 325 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 408 transitions. [2024-11-20 14:39:02,599 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 408 transitions. Word has length 16 [2024-11-20 14:39:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:02,600 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 408 transitions. [2024-11-20 14:39:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) 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-11-20 14:39:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 408 transitions. [2024-11-20 14:39:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:39:02,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:02,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:02,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:39:02,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:02,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:02,603 INFO L85 PathProgramCache]: Analyzing trace with hash -274285231, now seen corresponding path program 1 times [2024-11-20 14:39:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602618076] [2024-11-20 14:39:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602618076] [2024-11-20 14:39:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602618076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:02,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816441121] [2024-11-20 14:39:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:02,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:02,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:02,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:02,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:02,662 INFO L87 Difference]: Start difference. First operand 326 states and 408 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:02,835 INFO L93 Difference]: Finished difference Result 310 states and 376 transitions. [2024-11-20 14:39:02,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:02,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 14:39:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:02,837 INFO L225 Difference]: With dead ends: 310 [2024-11-20 14:39:02,837 INFO L226 Difference]: Without dead ends: 310 [2024-11-20 14:39:02,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:02,838 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 60 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 345 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-11-20 14:39:02,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 345 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-20 14:39:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-20 14:39:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 214 states have (on average 1.7570093457943925) internal successors, (376), 309 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 376 transitions. [2024-11-20 14:39:02,844 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 376 transitions. Word has length 17 [2024-11-20 14:39:02,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:02,844 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 376 transitions. [2024-11-20 14:39:02,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 376 transitions. [2024-11-20 14:39:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:39:02,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:02,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:02,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:39:02,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:02,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash -274285230, now seen corresponding path program 1 times [2024-11-20 14:39:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892567559] [2024-11-20 14:39:02,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:02,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892567559] [2024-11-20 14:39:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892567559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:02,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:39:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099024578] [2024-11-20 14:39:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:02,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:02,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:02,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:02,926 INFO L87 Difference]: Start difference. First operand 310 states and 376 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:03,083 INFO L93 Difference]: Finished difference Result 294 states and 344 transitions. [2024-11-20 14:39:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-20 14:39:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:03,085 INFO L225 Difference]: With dead ends: 294 [2024-11-20 14:39:03,085 INFO L226 Difference]: Without dead ends: 294 [2024-11-20 14:39:03,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:03,086 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 60 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:03,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 354 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-20 14:39:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-20 14:39:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 214 states have (on average 1.6074766355140186) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2024-11-20 14:39:03,094 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 17 [2024-11-20 14:39:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:03,096 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2024-11-20 14:39:03,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2024-11-20 14:39:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:39:03,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:03,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:03,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:39:03,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1595092334, now seen corresponding path program 1 times [2024-11-20 14:39:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:03,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991828725] [2024-11-20 14:39:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:03,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991828725] [2024-11-20 14:39:03,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991828725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:03,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:03,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:39:03,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863013430] [2024-11-20 14:39:03,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:03,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:03,211 INFO L87 Difference]: Start difference. First operand 294 states and 344 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-11-20 14:39:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:03,289 INFO L93 Difference]: Finished difference Result 312 states and 347 transitions. [2024-11-20 14:39:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:39:03,289 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-11-20 14:39:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:03,291 INFO L225 Difference]: With dead ends: 312 [2024-11-20 14:39:03,291 INFO L226 Difference]: Without dead ends: 312 [2024-11-20 14:39:03,291 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-11-20 14:39:03,292 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 64 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:03,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 986 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-20 14:39:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 292. [2024-11-20 14:39:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 212 states have (on average 1.599056603773585) internal successors, (339), 291 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 339 transitions. [2024-11-20 14:39:03,298 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 339 transitions. Word has length 19 [2024-11-20 14:39:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:03,298 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 339 transitions. [2024-11-20 14:39:03,298 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-11-20 14:39:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 339 transitions. [2024-11-20 14:39:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:39:03,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:03,299 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:03,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:39:03,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:03,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279430, now seen corresponding path program 1 times [2024-11-20 14:39:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:03,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35373237] [2024-11-20 14:39:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:03,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:03,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35373237] [2024-11-20 14:39:03,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35373237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:03,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:03,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:39:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742275562] [2024-11-20 14:39:03,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:03,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:39:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:03,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:39:03,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:39:03,456 INFO L87 Difference]: Start difference. First operand 292 states and 339 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-20 14:39:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:03,764 INFO L93 Difference]: Finished difference Result 313 states and 362 transitions. [2024-11-20 14:39:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:39:03,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-20 14:39:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:03,766 INFO L225 Difference]: With dead ends: 313 [2024-11-20 14:39:03,766 INFO L226 Difference]: Without dead ends: 313 [2024-11-20 14:39:03,767 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-11-20 14:39:03,767 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 82 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:03,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 612 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:39:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-20 14:39:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 294. [2024-11-20 14:39:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 216 states have (on average 1.5925925925925926) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2024-11-20 14:39:03,774 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 19 [2024-11-20 14:39:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:03,774 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2024-11-20 14:39:03,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-20 14:39:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2024-11-20 14:39:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:39:03,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:03,775 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:39:03,776 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279429, now seen corresponding path program 1 times [2024-11-20 14:39:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032640348] [2024-11-20 14:39:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:03,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032640348] [2024-11-20 14:39:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032640348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:39:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921931884] [2024-11-20 14:39:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:03,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:03,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:03,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:03,958 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand has 5 states, 4 states have (on average 4.75) 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-11-20 14:39:04,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:04,268 INFO L93 Difference]: Finished difference Result 301 states and 351 transitions. [2024-11-20 14:39:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:39:04,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) 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-11-20 14:39:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:04,270 INFO L225 Difference]: With dead ends: 301 [2024-11-20 14:39:04,270 INFO L226 Difference]: Without dead ends: 301 [2024-11-20 14:39:04,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:39:04,271 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 64 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:04,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 652 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:39:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-20 14:39:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2024-11-20 14:39:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 1.587962962962963) internal successors, (343), 292 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 343 transitions. [2024-11-20 14:39:04,279 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 343 transitions. Word has length 19 [2024-11-20 14:39:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:04,279 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 343 transitions. [2024-11-20 14:39:04,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) 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-11-20 14:39:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 343 transitions. [2024-11-20 14:39:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:39:04,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:04,280 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] [2024-11-20 14:39:04,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:39:04,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:04,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash 766206406, now seen corresponding path program 1 times [2024-11-20 14:39:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845669914] [2024-11-20 14:39:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:04,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845669914] [2024-11-20 14:39:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845669914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:39:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906863188] [2024-11-20 14:39:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:04,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:39:04,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:04,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:39:04,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:39:04,445 INFO L87 Difference]: Start difference. First operand 293 states and 343 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-11-20 14:39:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:04,619 INFO L93 Difference]: Finished difference Result 310 states and 348 transitions. [2024-11-20 14:39:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:39:04,620 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-11-20 14:39:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:04,622 INFO L225 Difference]: With dead ends: 310 [2024-11-20 14:39:04,622 INFO L226 Difference]: Without dead ends: 310 [2024-11-20 14:39:04,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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-11-20 14:39:04,623 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 81 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:04,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1446 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-20 14:39:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 279. [2024-11-20 14:39:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 202 states have (on average 1.5841584158415842) internal successors, (320), 278 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-11-20 14:39:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 320 transitions. [2024-11-20 14:39:04,628 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 320 transitions. Word has length 24 [2024-11-20 14:39:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:04,628 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 320 transitions. [2024-11-20 14:39:04,628 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-11-20 14:39:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 320 transitions. [2024-11-20 14:39:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:39:04,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:04,628 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-11-20 14:39:04,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:39:04,629 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-11-20 14:39:04,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1404977477, now seen corresponding path program 1 times [2024-11-20 14:39:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342382033] [2024-11-20 14:39:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:04,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:04,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342382033] [2024-11-20 14:39:04,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342382033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:04,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:04,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:39:04,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796497789] [2024-11-20 14:39:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:04,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:04,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:04,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:04,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:04,696 INFO L87 Difference]: Start difference. First operand 279 states and 320 transitions. Second operand has 5 states, 5 states have (on average 4.8) 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-11-20 14:39:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:04,766 INFO L93 Difference]: Finished difference Result 287 states and 327 transitions. [2024-11-20 14:39:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:39:04,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) 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 24 [2024-11-20 14:39:04,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:04,767 INFO L225 Difference]: With dead ends: 287 [2024-11-20 14:39:04,767 INFO L226 Difference]: Without dead ends: 287 [2024-11-20 14:39:04,768 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-11-20 14:39:04,768 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 67 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:04,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 986 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-20 14:39:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2024-11-20 14:39:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 278 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 319 transitions. [2024-11-20 14:39:04,773 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 319 transitions. Word has length 24 [2024-11-20 14:39:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:04,773 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 319 transitions. [2024-11-20 14:39:04,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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-11-20 14:39:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 319 transitions. [2024-11-20 14:39:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:39:04,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:04,774 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, 1] [2024-11-20 14:39:04,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:39:04,774 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:04,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1875176863, now seen corresponding path program 1 times [2024-11-20 14:39:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:04,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573831829] [2024-11-20 14:39:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:04,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:04,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573831829] [2024-11-20 14:39:04,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573831829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:04,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:04,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:39:04,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676069971] [2024-11-20 14:39:04,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:04,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:04,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:04,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:04,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:04,867 INFO L87 Difference]: Start difference. First operand 279 states and 319 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:05,150 INFO L93 Difference]: Finished difference Result 287 states and 320 transitions. [2024-11-20 14:39:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:39:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-20 14:39:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:05,152 INFO L225 Difference]: With dead ends: 287 [2024-11-20 14:39:05,152 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 14:39:05,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:05,152 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 26 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:05,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 659 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:39:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 14:39:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 277. [2024-11-20 14:39:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 200 states have (on average 1.58) internal successors, (316), 276 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 316 transitions. [2024-11-20 14:39:05,158 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 316 transitions. Word has length 26 [2024-11-20 14:39:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:05,158 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 316 transitions. [2024-11-20 14:39:05,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 316 transitions. [2024-11-20 14:39:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:39:05,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:05,159 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] [2024-11-20 14:39:05,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:39:05,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:05,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:05,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1816134400, now seen corresponding path program 1 times [2024-11-20 14:39:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:05,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299514824] [2024-11-20 14:39:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:05,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299514824] [2024-11-20 14:39:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299514824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:05,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:39:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434907420] [2024-11-20 14:39:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:05,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:39:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:05,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:39:05,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:39:05,541 INFO L87 Difference]: Start difference. First operand 277 states and 316 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:06,284 INFO L93 Difference]: Finished difference Result 280 states and 319 transitions. [2024-11-20 14:39:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:39:06,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-20 14:39:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:06,286 INFO L225 Difference]: With dead ends: 280 [2024-11-20 14:39:06,286 INFO L226 Difference]: Without dead ends: 280 [2024-11-20 14:39:06,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:39:06,287 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 79 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:06,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1412 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 14:39:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-20 14:39:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2024-11-20 14:39:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 200 states have (on average 1.575) internal successors, (315), 275 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-11-20 14:39:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 315 transitions. [2024-11-20 14:39:06,292 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 315 transitions. Word has length 26 [2024-11-20 14:39:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:06,292 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 315 transitions. [2024-11-20 14:39:06,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 315 transitions. [2024-11-20 14:39:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:39:06,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:06,293 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] [2024-11-20 14:39:06,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 14:39:06,293 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:06,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:06,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1816134399, now seen corresponding path program 1 times [2024-11-20 14:39:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587833921] [2024-11-20 14:39:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587833921] [2024-11-20 14:39:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587833921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:06,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:39:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522685553] [2024-11-20 14:39:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:39:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:39:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:39:06,788 INFO L87 Difference]: Start difference. First operand 276 states and 315 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:07,579 INFO L93 Difference]: Finished difference Result 279 states and 318 transitions. [2024-11-20 14:39:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:39:07,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-20 14:39:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:07,581 INFO L225 Difference]: With dead ends: 279 [2024-11-20 14:39:07,581 INFO L226 Difference]: Without dead ends: 279 [2024-11-20 14:39:07,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:39:07,582 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 79 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:07,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1492 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:39:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-20 14:39:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2024-11-20 14:39:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 200 states have (on average 1.57) internal successors, (314), 274 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-11-20 14:39:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 314 transitions. [2024-11-20 14:39:07,588 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 314 transitions. Word has length 26 [2024-11-20 14:39:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:07,589 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 314 transitions. [2024-11-20 14:39:07,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 314 transitions. [2024-11-20 14:39:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:39:07,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:07,589 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, 1, 1] [2024-11-20 14:39:07,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:39:07,590 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:07,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1993373733, now seen corresponding path program 1 times [2024-11-20 14:39:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054410353] [2024-11-20 14:39:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:07,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:07,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054410353] [2024-11-20 14:39:07,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054410353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:07,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:07,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:39:07,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608409387] [2024-11-20 14:39:07,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:07,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:39:07,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:07,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:39:07,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:39:07,626 INFO L87 Difference]: Start difference. First operand 275 states and 314 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:07,639 INFO L93 Difference]: Finished difference Result 260 states and 289 transitions. [2024-11-20 14:39:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:39:07,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-20 14:39:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:07,641 INFO L225 Difference]: With dead ends: 260 [2024-11-20 14:39:07,641 INFO L226 Difference]: Without dead ends: 242 [2024-11-20 14:39:07,641 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-11-20 14:39:07,642 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:07,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:39:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-20 14:39:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-20 14:39:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 167 states have (on average 1.622754491017964) internal successors, (271), 241 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2024-11-20 14:39:07,648 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 27 [2024-11-20 14:39:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:07,648 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2024-11-20 14:39:07,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2024-11-20 14:39:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:39:07,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:07,649 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] [2024-11-20 14:39:07,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 14:39:07,649 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:07,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:07,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1558220137, now seen corresponding path program 1 times [2024-11-20 14:39:07,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:07,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072719534] [2024-11-20 14:39:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:07,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072719534] [2024-11-20 14:39:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072719534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:07,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:07,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:39:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621327414] [2024-11-20 14:39:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:07,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:39:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:07,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:39:07,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:39:07,788 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:07,915 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2024-11-20 14:39:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:39:07,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-20 14:39:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:07,916 INFO L225 Difference]: With dead ends: 261 [2024-11-20 14:39:07,916 INFO L226 Difference]: Without dead ends: 261 [2024-11-20 14:39:07,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:39:07,917 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 114 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:07,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1346 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-20 14:39:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 242. [2024-11-20 14:39:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 167 states have (on average 1.6167664670658684) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2024-11-20 14:39:07,921 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 28 [2024-11-20 14:39:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:07,922 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2024-11-20 14:39:07,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2024-11-20 14:39:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:39:07,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:07,922 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] [2024-11-20 14:39:07,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 14:39:07,923 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-11-20 14:39:07,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:07,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1987134582, now seen corresponding path program 1 times [2024-11-20 14:39:07,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:07,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258434694] [2024-11-20 14:39:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:39:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258434694] [2024-11-20 14:39:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258434694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:08,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:39:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663642240] [2024-11-20 14:39:08,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:08,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:08,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:08,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:08,075 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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-11-20 14:39:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:08,293 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2024-11-20 14:39:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:39:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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 30 [2024-11-20 14:39:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:08,294 INFO L225 Difference]: With dead ends: 260 [2024-11-20 14:39:08,294 INFO L226 Difference]: Without dead ends: 260 [2024-11-20 14:39:08,295 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-11-20 14:39:08,295 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 22 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:08,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 727 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-20 14:39:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 241. [2024-11-20 14:39:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 167 states have (on average 1.6107784431137724) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2024-11-20 14:39:08,299 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 30 [2024-11-20 14:39:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:08,300 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2024-11-20 14:39:08,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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-11-20 14:39:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2024-11-20 14:39:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:39:08,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:08,301 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] [2024-11-20 14:39:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 14:39:08,301 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-11-20 14:39:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1987134581, now seen corresponding path program 1 times [2024-11-20 14:39:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:08,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321844633] [2024-11-20 14:39:08,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:08,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:08,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321844633] [2024-11-20 14:39:08,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321844633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:08,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:08,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:39:08,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631648750] [2024-11-20 14:39:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:08,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:39:08,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:39:08,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:39:08,694 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:09,359 INFO L93 Difference]: Finished difference Result 267 states and 298 transitions. [2024-11-20 14:39:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:39:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-20 14:39:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:09,361 INFO L225 Difference]: With dead ends: 267 [2024-11-20 14:39:09,361 INFO L226 Difference]: Without dead ends: 267 [2024-11-20 14:39:09,361 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-11-20 14:39:09,362 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 102 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:09,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1090 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:39:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-20 14:39:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 240. [2024-11-20 14:39:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 167 states have (on average 1.6047904191616766) internal successors, (268), 239 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 268 transitions. [2024-11-20 14:39:09,371 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 268 transitions. Word has length 30 [2024-11-20 14:39:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:09,371 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 268 transitions. [2024-11-20 14:39:09,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 268 transitions. [2024-11-20 14:39:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:39:09,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:09,373 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-11-20 14:39:09,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:39:09,373 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-11-20 14:39:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash 701329618, now seen corresponding path program 1 times [2024-11-20 14:39:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911849529] [2024-11-20 14:39:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911849529] [2024-11-20 14:39:09,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911849529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:09,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:09,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:39:09,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446570065] [2024-11-20 14:39:09,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:09,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:39:09,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:09,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:39:09,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:39:09,640 INFO L87 Difference]: Start difference. First operand 240 states and 268 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:09,900 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2024-11-20 14:39:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:39:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-20 14:39:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:09,902 INFO L225 Difference]: With dead ends: 243 [2024-11-20 14:39:09,902 INFO L226 Difference]: Without dead ends: 243 [2024-11-20 14:39:09,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-20 14:39:09,903 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 70 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:09,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2174 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-20 14:39:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2024-11-20 14:39:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2024-11-20 14:39:09,907 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 34 [2024-11-20 14:39:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:09,907 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2024-11-20 14:39:09,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2024-11-20 14:39:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:39:09,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:09,908 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-11-20 14:39:09,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 14:39:09,908 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:09,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1701687506, now seen corresponding path program 1 times [2024-11-20 14:39:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:09,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330210495] [2024-11-20 14:39:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330210495] [2024-11-20 14:39:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330210495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:39:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114621364] [2024-11-20 14:39:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:39:10,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:39:10,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:39:10,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:39:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:10,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 14:39:10,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:39:10,870 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-11-20 14:39:10,876 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-11-20 14:39:10,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:39:10,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:39:11,001 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-11-20 14:39:11,006 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-11-20 14:39:11,075 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-11-20 14:39:11,080 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-11-20 14:39:11,099 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-11-20 14:39:11,103 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 34 treesize of output 22 [2024-11-20 14:39:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:11,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:39:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114621364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:39:11,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:39:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2024-11-20 14:39:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399282714] [2024-11-20 14:39:11,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:39:11,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:39:11,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:11,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:39:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:39:11,268 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:11,845 INFO L93 Difference]: Finished difference Result 321 states and 358 transitions. [2024-11-20 14:39:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:39:11,845 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 14:39:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:11,847 INFO L225 Difference]: With dead ends: 321 [2024-11-20 14:39:11,847 INFO L226 Difference]: Without dead ends: 321 [2024-11-20 14:39:11,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-11-20 14:39:11,848 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 93 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2757 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:11,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2757 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:39:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-20 14:39:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 269. [2024-11-20 14:39:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 196 states have (on average 1.5255102040816326) internal successors, (299), 268 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 299 transitions. [2024-11-20 14:39:11,854 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 299 transitions. Word has length 34 [2024-11-20 14:39:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:11,854 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 299 transitions. [2024-11-20 14:39:11,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 299 transitions. [2024-11-20 14:39:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 14:39:11,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:11,855 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] [2024-11-20 14:39:11,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 14:39:12,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-20 14:39:12,056 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:12,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:12,056 INFO L85 PathProgramCache]: Analyzing trace with hash 272167309, now seen corresponding path program 1 times [2024-11-20 14:39:12,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:12,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679161758] [2024-11-20 14:39:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:12,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679161758] [2024-11-20 14:39:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679161758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:12,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:12,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 14:39:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882596111] [2024-11-20 14:39:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:12,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:39:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:39:12,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:39:12,837 INFO L87 Difference]: Start difference. First operand 269 states and 299 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:13,351 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2024-11-20 14:39:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 14:39:13,352 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-20 14:39:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:13,353 INFO L225 Difference]: With dead ends: 269 [2024-11-20 14:39:13,353 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 14:39:13,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-11-20 14:39:13,354 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 71 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:13,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2085 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:39:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 14:39:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-20 14:39:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 196 states have (on average 1.5153061224489797) internal successors, (297), 268 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 297 transitions. [2024-11-20 14:39:13,358 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 297 transitions. Word has length 35 [2024-11-20 14:39:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:13,359 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 297 transitions. [2024-11-20 14:39:13,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 297 transitions. [2024-11-20 14:39:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-20 14:39:13,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:13,360 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] [2024-11-20 14:39:13,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-20 14:39:13,360 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-11-20 14:39:13,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1410894497, now seen corresponding path program 1 times [2024-11-20 14:39:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:13,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394345398] [2024-11-20 14:39:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-20 14:39:13,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:13,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394345398] [2024-11-20 14:39:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394345398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:13,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:39:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967223514] [2024-11-20 14:39:13,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:13,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:13,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:13,528 INFO L87 Difference]: Start difference. First operand 269 states and 297 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:13,582 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2024-11-20 14:39:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:39:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 40 [2024-11-20 14:39:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:13,583 INFO L225 Difference]: With dead ends: 276 [2024-11-20 14:39:13,583 INFO L226 Difference]: Without dead ends: 276 [2024-11-20 14:39:13,584 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-11-20 14:39:13,584 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:13,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 964 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:39:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-20 14:39:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2024-11-20 14:39:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 201 states have (on average 1.5024875621890548) internal successors, (302), 273 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2024-11-20 14:39:13,592 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 40 [2024-11-20 14:39:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:13,592 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2024-11-20 14:39:13,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2024-11-20 14:39:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:39:13,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:13,593 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-11-20 14:39:13,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-20 14:39:13,593 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-11-20 14:39:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1273967899, now seen corresponding path program 1 times [2024-11-20 14:39:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493774669] [2024-11-20 14:39:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:13,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493774669] [2024-11-20 14:39:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493774669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:39:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497367811] [2024-11-20 14:39:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:13,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:39:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:39:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:39:13,761 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 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-11-20 14:39:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:14,202 INFO L93 Difference]: Finished difference Result 344 states and 383 transitions. [2024-11-20 14:39:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:39:14,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 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-11-20 14:39:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:14,204 INFO L225 Difference]: With dead ends: 344 [2024-11-20 14:39:14,204 INFO L226 Difference]: Without dead ends: 344 [2024-11-20 14:39:14,204 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-11-20 14:39:14,205 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 182 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:14,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 669 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:39:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-20 14:39:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 277. [2024-11-20 14:39:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 206 states have (on average 1.5) internal successors, (309), 276 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 309 transitions. [2024-11-20 14:39:14,209 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 309 transitions. Word has length 42 [2024-11-20 14:39:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:14,210 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 309 transitions. [2024-11-20 14:39:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 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-11-20 14:39:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 309 transitions. [2024-11-20 14:39:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 14:39:14,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:14,210 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-11-20 14:39:14,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-20 14:39:14,211 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-11-20 14:39:14,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1273967900, now seen corresponding path program 1 times [2024-11-20 14:39:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:14,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001038810] [2024-11-20 14:39:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:14,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001038810] [2024-11-20 14:39:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001038810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:14,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:39:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605911762] [2024-11-20 14:39:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:14,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:39:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:39:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:39:14,567 INFO L87 Difference]: Start difference. First operand 277 states and 309 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 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-11-20 14:39:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:14,927 INFO L93 Difference]: Finished difference Result 361 states and 406 transitions. [2024-11-20 14:39:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:39:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 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-11-20 14:39:14,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:14,929 INFO L225 Difference]: With dead ends: 361 [2024-11-20 14:39:14,929 INFO L226 Difference]: Without dead ends: 361 [2024-11-20 14:39:14,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:39:14,929 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 237 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:14,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 862 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:39:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-20 14:39:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 340. [2024-11-20 14:39:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 269 states have (on average 1.5055762081784387) internal successors, (405), 339 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 405 transitions. [2024-11-20 14:39:14,936 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 405 transitions. Word has length 42 [2024-11-20 14:39:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:14,937 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 405 transitions. [2024-11-20 14:39:14,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 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-11-20 14:39:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 405 transitions. [2024-11-20 14:39:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 14:39:14,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:14,938 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:14,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-20 14:39:14,939 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-11-20 14:39:14,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash -887838045, now seen corresponding path program 2 times [2024-11-20 14:39:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678164090] [2024-11-20 14:39:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:15,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:15,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678164090] [2024-11-20 14:39:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678164090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:39:15,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849662326] [2024-11-20 14:39:15,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:39:15,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:39:15,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:39:15,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:39:15,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:39:16,058 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:39:16,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:39:16,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-20 14:39:16,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:39:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:39:16,168 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:39:16,168 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 19 treesize of output 16 [2024-11-20 14:39:16,213 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:39:16,214 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-11-20 14:39:16,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:39:16,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:39:16,380 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 26 treesize of output 21 [2024-11-20 14:39:16,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:39:16,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:39:16,540 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-11-20 14:39:16,547 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 55 treesize of output 31 [2024-11-20 14:39:16,638 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-11-20 14:39:16,644 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 55 treesize of output 31 [2024-11-20 14:39:16,678 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-11-20 14:39:16,728 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 38 treesize of output 14 [2024-11-20 14:39:16,773 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-11-20 14:39:16,846 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-11-20 14:39:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:16,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:39:20,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_57| Int) (v_ArrVal_1046 Int) (v_ArrVal_1049 Int) (|v_ULTIMATE.start_main_~item~0#1.base_19| Int)) (let ((.cse0 (store (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_19| v_ArrVal_1046) |v_ULTIMATE.start_main_~#iter~0#1.base_57| v_ArrVal_1049))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_19|) 1)) (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) 1) (< |v_ULTIMATE.start_main_~#iter~0#1.base_57| (+ |c_#StackHeapBarrier| 1))))) is different from false [2024-11-20 14:39:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849662326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:39:20,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:39:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2024-11-20 14:39:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417234313] [2024-11-20 14:39:20,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:39:20,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-20 14:39:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:20,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-20 14:39:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1092, Unknown=1, NotChecked=66, Total=1260 [2024-11-20 14:39:20,298 INFO L87 Difference]: Start difference. First operand 340 states and 405 transitions. Second operand has 36 states, 35 states have (on average 3.4) internal successors, (119), 36 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:22,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:22,680 INFO L93 Difference]: Finished difference Result 382 states and 454 transitions. [2024-11-20 14:39:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 14:39:22,681 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.4) internal successors, (119), 36 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-20 14:39:22,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:22,682 INFO L225 Difference]: With dead ends: 382 [2024-11-20 14:39:22,682 INFO L226 Difference]: Without dead ends: 382 [2024-11-20 14:39:22,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=295, Invalid=2158, Unknown=1, NotChecked=96, Total=2550 [2024-11-20 14:39:22,684 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 532 mSDsluCounter, 3027 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:22,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 3246 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3086 Invalid, 0 Unknown, 227 Unchecked, 1.9s Time] [2024-11-20 14:39:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-20 14:39:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 339. [2024-11-20 14:39:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 269 states have (on average 1.5018587360594795) internal successors, (404), 338 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-11-20 14:39:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 404 transitions. [2024-11-20 14:39:22,689 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 404 transitions. Word has length 45 [2024-11-20 14:39:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:22,690 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 404 transitions. [2024-11-20 14:39:22,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.4) internal successors, (119), 36 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 404 transitions. [2024-11-20 14:39:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 14:39:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:22,690 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:22,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:39:22,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-20 14:39:22,894 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-11-20 14:39:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -887838044, now seen corresponding path program 1 times [2024-11-20 14:39:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612763438] [2024-11-20 14:39:22,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:24,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612763438] [2024-11-20 14:39:24,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612763438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:39:24,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619818800] [2024-11-20 14:39:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:39:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:39:24,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:39:24,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:39:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:24,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-20 14:39:24,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:39:24,421 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-11-20 14:39:24,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:39:24,538 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:39:24,539 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 19 treesize of output 16 [2024-11-20 14:39:24,545 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-11-20 14:39:24,593 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:39:24,593 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-11-20 14:39:24,608 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:39:24,608 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 11 treesize of output 11 [2024-11-20 14:39:24,662 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-11-20 14:39:24,670 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-11-20 14:39:24,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:39:24,772 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-11-20 14:39:24,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:39:24,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:39:24,879 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-11-20 14:39:24,886 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-11-20 14:39:24,966 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-11-20 14:39:24,969 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-11-20 14:39:25,058 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-11-20 14:39:25,067 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-11-20 14:39:25,106 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-11-20 14:39:25,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:39:25,149 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-11-20 14:39:25,152 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-11-20 14:39:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:25,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:39:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619818800] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:39:31,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:39:31,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 39 [2024-11-20 14:39:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386889229] [2024-11-20 14:39:31,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:39:31,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-20 14:39:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-20 14:39:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1454, Unknown=2, NotChecked=0, Total=1560 [2024-11-20 14:39:31,225 INFO L87 Difference]: Start difference. First operand 339 states and 404 transitions. Second operand has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:34,168 INFO L93 Difference]: Finished difference Result 365 states and 433 transitions. [2024-11-20 14:39:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 14:39:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 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-11-20 14:39:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:34,170 INFO L225 Difference]: With dead ends: 365 [2024-11-20 14:39:34,170 INFO L226 Difference]: Without dead ends: 365 [2024-11-20 14:39:34,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=356, Invalid=2834, Unknown=2, NotChecked=0, Total=3192 [2024-11-20 14:39:34,171 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 329 mSDsluCounter, 4002 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 4326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:34,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 4227 Invalid, 4326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4311 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 14:39:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-20 14:39:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2024-11-20 14:39:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 269 states have (on average 1.4981412639405205) internal successors, (403), 337 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 403 transitions. [2024-11-20 14:39:34,176 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 403 transitions. Word has length 45 [2024-11-20 14:39:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:34,177 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 403 transitions. [2024-11-20 14:39:34,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 40 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 403 transitions. [2024-11-20 14:39:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-20 14:39:34,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:34,178 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, 1, 1, 1] [2024-11-20 14:39:34,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 14:39:34,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:39:34,382 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-11-20 14:39:34,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1274071840, now seen corresponding path program 1 times [2024-11-20 14:39:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725709622] [2024-11-20 14:39:34,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:34,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:34,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725709622] [2024-11-20 14:39:34,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725709622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:34,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:34,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:39:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577046767] [2024-11-20 14:39:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:34,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:39:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:39:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:39:34,503 INFO L87 Difference]: Start difference. First operand 338 states and 403 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:34,652 INFO L93 Difference]: Finished difference Result 417 states and 471 transitions. [2024-11-20 14:39:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:39:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-20 14:39:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:34,654 INFO L225 Difference]: With dead ends: 417 [2024-11-20 14:39:34,654 INFO L226 Difference]: Without dead ends: 417 [2024-11-20 14:39:34,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:39:34,655 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 238 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:34,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1403 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:39:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-20 14:39:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 337. [2024-11-20 14:39:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 268 states have (on average 1.4888059701492538) internal successors, (399), 336 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 399 transitions. [2024-11-20 14:39:34,660 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 399 transitions. Word has length 46 [2024-11-20 14:39:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:34,660 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 399 transitions. [2024-11-20 14:39:34,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 399 transitions. [2024-11-20 14:39:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 14:39:34,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:34,661 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, 1, 1, 1, 1, 1] [2024-11-20 14:39:34,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-20 14:39:34,661 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:34,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1390296253, now seen corresponding path program 1 times [2024-11-20 14:39:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506289538] [2024-11-20 14:39:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 14:39:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506289538] [2024-11-20 14:39:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506289538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:34,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:39:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789566802] [2024-11-20 14:39:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:34,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:39:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:34,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:39:34,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:39:34,779 INFO L87 Difference]: Start difference. First operand 337 states and 399 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:34,975 INFO L93 Difference]: Finished difference Result 341 states and 404 transitions. [2024-11-20 14:39:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:39:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-20 14:39:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:34,976 INFO L225 Difference]: With dead ends: 341 [2024-11-20 14:39:34,977 INFO L226 Difference]: Without dead ends: 341 [2024-11-20 14:39:34,977 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-11-20 14:39:34,977 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 63 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:34,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 414 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-20 14:39:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-11-20 14:39:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 272 states have (on average 1.4852941176470589) internal successors, (404), 340 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-11-20 14:39:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 404 transitions. [2024-11-20 14:39:34,982 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 404 transitions. Word has length 48 [2024-11-20 14:39:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:34,982 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 404 transitions. [2024-11-20 14:39:34,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 404 transitions. [2024-11-20 14:39:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 14:39:34,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:34,983 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, 1, 1, 1, 1, 1] [2024-11-20 14:39:34,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-20 14:39:34,984 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:34,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1390296252, now seen corresponding path program 1 times [2024-11-20 14:39:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474562234] [2024-11-20 14:39:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:34,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:35,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:35,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474562234] [2024-11-20 14:39:35,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474562234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:35,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:35,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 14:39:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168299358] [2024-11-20 14:39:35,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:35,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:39:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:35,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:39:35,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:39:35,477 INFO L87 Difference]: Start difference. First operand 341 states and 404 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:36,161 INFO L93 Difference]: Finished difference Result 416 states and 466 transitions. [2024-11-20 14:39:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:39:36,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-20 14:39:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:36,163 INFO L225 Difference]: With dead ends: 416 [2024-11-20 14:39:36,163 INFO L226 Difference]: Without dead ends: 416 [2024-11-20 14:39:36,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:39:36,164 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 244 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:36,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 995 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:39:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-20 14:39:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 372. [2024-11-20 14:39:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 303 states have (on average 1.5313531353135315) internal successors, (464), 371 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 464 transitions. [2024-11-20 14:39:36,173 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 464 transitions. Word has length 48 [2024-11-20 14:39:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:36,173 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 464 transitions. [2024-11-20 14:39:36,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 464 transitions. [2024-11-20 14:39:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-20 14:39:36,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:36,174 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:36,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-20 14:39:36,176 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:36,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1322739502, now seen corresponding path program 1 times [2024-11-20 14:39:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197042745] [2024-11-20 14:39:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:36,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197042745] [2024-11-20 14:39:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197042745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:39:36,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518203117] [2024-11-20 14:39:36,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:36,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:39:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:39:36,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:39:36,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:39:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:36,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 14:39:36,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:39:36,897 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-11-20 14:39:36,900 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-11-20 14:39:36,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:39:36,983 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-11-20 14:39:37,021 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-11-20 14:39:37,040 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-11-20 14:39:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:37,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:39:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:37,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518203117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:39:37,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:39:37,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 18 [2024-11-20 14:39:37,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864407892] [2024-11-20 14:39:37,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:39:37,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 14:39:37,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:37,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 14:39:37,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:39:37,237 INFO L87 Difference]: Start difference. First operand 372 states and 464 transitions. Second operand has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 18 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:37,617 INFO L93 Difference]: Finished difference Result 460 states and 563 transitions. [2024-11-20 14:39:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:39:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 18 states have internal predecessors, (106), 0 states have call successors, (0), 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 51 [2024-11-20 14:39:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:37,619 INFO L225 Difference]: With dead ends: 460 [2024-11-20 14:39:37,619 INFO L226 Difference]: Without dead ends: 460 [2024-11-20 14:39:37,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-11-20 14:39:37,619 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 165 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:37,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 2602 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:39:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-20 14:39:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 384. [2024-11-20 14:39:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.511111111111111) internal successors, (476), 383 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2024-11-20 14:39:37,625 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 51 [2024-11-20 14:39:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:37,625 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2024-11-20 14:39:37,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.888888888888889) internal successors, (106), 18 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:37,625 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2024-11-20 14:39:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 14:39:37,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:37,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:37,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 14:39:37,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-20 14:39:37,827 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2024-11-20 14:39:37,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1528182709, now seen corresponding path program 1 times [2024-11-20 14:39:37,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:37,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271112349] [2024-11-20 14:39:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:39:37,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271112349] [2024-11-20 14:39:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271112349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:39:37,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:39:37,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:39:37,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288463445] [2024-11-20 14:39:37,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:39:37,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:39:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:39:37,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:39:37,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:39:37,945 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:39:38,144 INFO L93 Difference]: Finished difference Result 431 states and 484 transitions. [2024-11-20 14:39:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:39:38,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-20 14:39:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:39:38,145 INFO L225 Difference]: With dead ends: 431 [2024-11-20 14:39:38,145 INFO L226 Difference]: Without dead ends: 431 [2024-11-20 14:39:38,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:39:38,146 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 231 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:39:38,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1403 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:39:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-20 14:39:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 384. [2024-11-20 14:39:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.507936507936508) internal successors, (475), 383 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 475 transitions. [2024-11-20 14:39:38,152 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 475 transitions. Word has length 53 [2024-11-20 14:39:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:39:38,152 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 475 transitions. [2024-11-20 14:39:38,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:39:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 475 transitions. [2024-11-20 14:39:38,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 14:39:38,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:39:38,153 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:39:38,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-20 14:39:38,153 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-11-20 14:39:38,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:39:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash 122481897, now seen corresponding path program 1 times [2024-11-20 14:39:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:39:38,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534562772] [2024-11-20 14:39:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:39:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:39:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:39:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534562772] [2024-11-20 14:39:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534562772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:39:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266247161] [2024-11-20 14:39:40,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:39:40,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:39:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:39:40,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:39:40,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:39:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:39:40,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-20 14:39:40,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:39:40,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:39:40,480 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-20 14:39:40,480 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 12 treesize of output 14 [2024-11-20 14:39:40,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:39:40,568 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 34 treesize of output 18 [2024-11-20 14:39:40,646 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-20 14:39:40,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-20 14:39:40,712 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 35 treesize of output 26 [2024-11-20 14:39:40,734 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 35 treesize of output 26 [2024-11-20 14:39:40,778 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-20 14:39:40,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-20 14:39:40,858 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 54 treesize of output 30 [2024-11-20 14:39:40,926 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 96 treesize of output 49 [2024-11-20 14:39:40,942 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 19 treesize of output 1 [2024-11-20 14:39:41,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:39:41,121 INFO L349 Elim1Store]: treesize reduction 49, result has 30.0 percent of original size [2024-11-20 14:39:41,122 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 2 case distinctions, treesize of input 35 treesize of output 43 [2024-11-20 14:39:41,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:39:41,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:39:41,441 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 247 treesize of output 190 [2024-11-20 14:39:41,449 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 253 treesize of output 193 [2024-11-20 14:39:42,149 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 189 [2024-11-20 14:39:42,154 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 249 treesize of output 189 [2024-11-20 14:39:42,436 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 35 treesize of output 7 [2024-11-20 14:39:42,534 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 247 treesize of output 183 [2024-11-20 14:39:42,538 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 193 treesize of output 130 [2024-11-20 14:39:43,355 INFO L349 Elim1Store]: treesize reduction 76, result has 70.4 percent of original size [2024-11-20 14:39:43,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 261 treesize of output 287 [2024-11-20 14:40:01,954 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 589 treesize of output 505 [2024-11-20 14:40:02,108 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-11-20 14:40:03,229 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-11-20 14:40:03,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:03,725 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 579 treesize of output 315 [2024-11-20 14:40:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:04,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:07,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:07,718 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 63 treesize of output 56 [2024-11-20 14:40:07,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:07,735 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 246 treesize of output 244 [2024-11-20 14:40:07,746 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 578 treesize of output 566 [2024-11-20 14:40:07,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:07,808 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 265 treesize of output 265