./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20020406-1.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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:34:37,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:34:37,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:34:37,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:34:37,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:34:37,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:34:37,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:34:37,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:34:37,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:34:37,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:34:37,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:34:37,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:34:37,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:34:37,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:34:37,333 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:34:37,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:34:37,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:34:37,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:34:37,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:34:37,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:34:37,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:34:37,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:34:37,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:34:37,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:34:37,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:37,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:34:37,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:34:37,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:34:37,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:34:37,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:34:37,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:34:37,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:34:37,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:34:37,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2025-03-04 07:34:37,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:34:37,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:34:37,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:34:37,562 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:34:37,562 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:34:37,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2025-03-04 07:34:38,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a70dff8a/4073a4369b494e539a55f068e842d30b/FLAGf56799172 [2025-03-04 07:34:38,994 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:34:38,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2025-03-04 07:34:39,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a70dff8a/4073a4369b494e539a55f068e842d30b/FLAGf56799172 [2025-03-04 07:34:39,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a70dff8a/4073a4369b494e539a55f068e842d30b [2025-03-04 07:34:39,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:34:39,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:34:39,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:39,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:34:39,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:34:39,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317c925c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39, skipping insertion in model container [2025-03-04 07:34:39,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:34:39,554 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:34:39,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:39,580 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:34:39,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:34:39,679 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:34:39,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39 WrapperNode [2025-03-04 07:34:39,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:34:39,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:39,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:34:39,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:34:39,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,722 INFO L138 Inliner]: procedures = 283, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-04 07:34:39,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:34:39,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:34:39,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:34:39,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:34:39,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,769 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 9, 2, 17]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 16 writes are split as follows [0, 6, 2, 8]. [2025-03-04 07:34:39,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:34:39,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:34:39,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:34:39,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:34:39,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (1/1) ... [2025-03-04 07:34:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:34:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:39,812 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) [2025-03-04 07:34:39,818 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 [2025-03-04 07:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2025-03-04 07:34:39,834 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2025-03-04 07:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:34:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:34:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:34:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:34:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 07:34:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2025-03-04 07:34:39,835 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2025-03-04 07:34:39,835 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2025-03-04 07:34:39,835 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2025-03-04 07:34:39,836 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2025-03-04 07:34:39,836 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 07:34:39,836 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2025-03-04 07:34:39,837 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2025-03-04 07:34:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:34:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:34:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:34:39,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 07:34:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:34:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:34:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:34:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:34:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:34:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 07:34:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2025-03-04 07:34:39,838 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2025-03-04 07:34:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2025-03-04 07:34:39,839 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2025-03-04 07:34:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:34:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:34:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:34:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 07:34:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:34:39,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:34:39,958 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:34:39,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:34:39,989 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L890: havoc #t~mem31; [2025-03-04 07:34:40,260 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L966: call ULTIMATE.dealloc(main_~#cf~0#1.base, main_~#cf~0#1.offset);havoc main_~#cf~0#1.base, main_~#cf~0#1.offset;call ULTIMATE.dealloc(main_~#cg~0#1.base, main_~#cg~0#1.offset);havoc main_~#cg~0#1.base, main_~#cg~0#1.offset; [2025-03-04 07:34:40,320 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-03-04 07:34:40,320 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:34:40,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:34:40,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:34:40,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:40 BoogieIcfgContainer [2025-03-04 07:34:40,329 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:34:40,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:34:40,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:34:40,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:34:40,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:34:39" (1/3) ... [2025-03-04 07:34:40,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a02e6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:40, skipping insertion in model container [2025-03-04 07:34:40,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:34:39" (2/3) ... [2025-03-04 07:34:40,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a02e6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:34:40, skipping insertion in model container [2025-03-04 07:34:40,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:40" (3/3) ... [2025-03-04 07:34:40,338 INFO L128 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2025-03-04 07:34:40,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:34:40,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 20020406-1.i that has 9 procedures, 192 locations, 1 initial locations, 3 loop locations, and 55 error locations. [2025-03-04 07:34:40,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:34:40,387 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;@765c23c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:34:40,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-03-04 07:34:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:34:40,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:40,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:34:40,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash 216661483, now seen corresponding path program 1 times [2025-03-04 07:34:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:40,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905625747] [2025-03-04 07:34:40,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:40,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:34:40,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:34:40,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:40,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905625747] [2025-03-04 07:34:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905625747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:40,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829531875] [2025-03-04 07:34:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:40,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:40,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:40,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:40,621 INFO L87 Difference]: Start difference. First operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:40,742 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-03-04 07:34:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:40,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:34:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:40,748 INFO L225 Difference]: With dead ends: 187 [2025-03-04 07:34:40,749 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 07:34:40,750 INFO L434 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 [2025-03-04 07:34:40,752 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 15 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:40,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:40,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 07:34:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-04 07:34:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 92 states have (on average 1.641304347826087) internal successors, (151), 144 states have internal predecessors, (151), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2025-03-04 07:34:40,790 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 5 [2025-03-04 07:34:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:40,790 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2025-03-04 07:34:40,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2025-03-04 07:34:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:34:40,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:40,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:34:40,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:34:40,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash 216661484, now seen corresponding path program 1 times [2025-03-04 07:34:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909472602] [2025-03-04 07:34:40,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:40,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:34:40,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:34:40,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:40,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909472602] [2025-03-04 07:34:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909472602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:40,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:34:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146030398] [2025-03-04 07:34:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:40,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:34:40,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:40,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:34:40,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:34:40,922 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:41,026 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-03-04 07:34:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:41,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:34:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:41,028 INFO L225 Difference]: With dead ends: 187 [2025-03-04 07:34:41,029 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 07:34:41,030 INFO L434 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 [2025-03-04 07:34:41,030 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:41,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 376 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 07:34:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2025-03-04 07:34:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 145 states have internal predecessors, (152), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2025-03-04 07:34:41,045 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 5 [2025-03-04 07:34:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:41,045 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2025-03-04 07:34:41,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2025-03-04 07:34:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:34:41,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:41,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:34:41,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:41,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2053254985, now seen corresponding path program 1 times [2025-03-04 07:34:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467015383] [2025-03-04 07:34:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:41,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:34:41,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:34:41,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:41,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467015383] [2025-03-04 07:34:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467015383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:34:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250952594] [2025-03-04 07:34:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:41,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:34:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:41,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:34:41,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:41,239 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:41,371 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-04 07:34:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:34:41,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:34:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:41,373 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:34:41,373 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:34:41,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:34:41,373 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 14 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:41,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 490 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:34:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-03-04 07:34:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-03-04 07:34:41,382 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 7 [2025-03-04 07:34:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:41,382 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-03-04 07:34:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-03-04 07:34:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:34:41,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:41,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:41,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:34:41,383 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:41,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:41,383 INFO L85 PathProgramCache]: Analyzing trace with hash 329766595, now seen corresponding path program 1 times [2025-03-04 07:34:41,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:41,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325185311] [2025-03-04 07:34:41,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:41,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:41,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:34:41,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:34:41,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:41,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325185311] [2025-03-04 07:34:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325185311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:41,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815326440] [2025-03-04 07:34:41,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:41,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:34:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:41,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:34:41,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:41,512 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:41,689 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-04 07:34:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:34:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:41,691 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:34:41,691 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:34:41,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:41,691 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 12 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:41,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 826 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:34:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-03-04 07:34:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 92 states have (on average 1.576086956521739) internal successors, (145), 138 states have internal predecessors, (145), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 215 transitions. [2025-03-04 07:34:41,705 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 215 transitions. Word has length 11 [2025-03-04 07:34:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:41,706 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 215 transitions. [2025-03-04 07:34:41,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 215 transitions. [2025-03-04 07:34:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:34:41,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:41,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:41,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:34:41,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:41,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:41,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1632829842, now seen corresponding path program 1 times [2025-03-04 07:34:41,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:41,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760786723] [2025-03-04 07:34:41,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:41,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:34:41,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:34:41,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:41,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760786723] [2025-03-04 07:34:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760786723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:41,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638965661] [2025-03-04 07:34:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:41,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:41,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:41,977 INFO L87 Difference]: Start difference. First operand 179 states and 215 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:42,235 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-03-04 07:34:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:34:42,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:34:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:42,236 INFO L225 Difference]: With dead ends: 195 [2025-03-04 07:34:42,236 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 07:34:42,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:34:42,237 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 25 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:42,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1244 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 07:34:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-04 07:34:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 107 states have (on average 1.5046728971962617) internal successors, (161), 153 states have internal predecessors, (161), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2025-03-04 07:34:42,244 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 12 [2025-03-04 07:34:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:42,244 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2025-03-04 07:34:42,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:34:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2025-03-04 07:34:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:34:42,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:42,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:42,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:34:42,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:42,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:42,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1085343452, now seen corresponding path program 1 times [2025-03-04 07:34:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:42,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17672103] [2025-03-04 07:34:42,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:42,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:34:42,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:34:42,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:42,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:42,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17672103] [2025-03-04 07:34:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17672103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:42,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950367539] [2025-03-04 07:34:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:34:42,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:42,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:34:42,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:42,329 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:42,482 INFO L93 Difference]: Finished difference Result 193 states and 229 transitions. [2025-03-04 07:34:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 07:34:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:42,483 INFO L225 Difference]: With dead ends: 193 [2025-03-04 07:34:42,483 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 07:34:42,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:42,484 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:42,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 783 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 07:34:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 07:34:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 107 states have (on average 1.485981308411215) internal successors, (159), 151 states have internal predecessors, (159), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 229 transitions. [2025-03-04 07:34:42,495 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 229 transitions. Word has length 21 [2025-03-04 07:34:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:42,496 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 229 transitions. [2025-03-04 07:34:42,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 229 transitions. [2025-03-04 07:34:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:34:42,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:42,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:34:42,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1085343451, now seen corresponding path program 1 times [2025-03-04 07:34:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872423195] [2025-03-04 07:34:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:34:42,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:34:42,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:42,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:42,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:42,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872423195] [2025-03-04 07:34:42,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872423195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:42,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:42,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:34:42,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929480519] [2025-03-04 07:34:42,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:42,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:34:42,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:42,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:34:42,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:42,666 INFO L87 Difference]: Start difference. First operand 193 states and 229 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:42,819 INFO L93 Difference]: Finished difference Result 191 states and 227 transitions. [2025-03-04 07:34:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:34:42,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 07:34:42,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:42,820 INFO L225 Difference]: With dead ends: 191 [2025-03-04 07:34:42,820 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 07:34:42,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:42,821 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:42,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 980 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 07:34:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-04 07:34:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 149 states have internal predecessors, (157), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2025-03-04 07:34:42,827 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 21 [2025-03-04 07:34:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:42,827 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2025-03-04 07:34:42,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2025-03-04 07:34:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:34:42,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:42,827 INFO L218 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] [2025-03-04 07:34:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:34:42,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:42,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash 714091514, now seen corresponding path program 1 times [2025-03-04 07:34:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290531639] [2025-03-04 07:34:42,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:42,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:34:42,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:34:42,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:42,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290531639] [2025-03-04 07:34:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290531639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:43,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:34:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693236852] [2025-03-04 07:34:43,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:43,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:34:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:43,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:34:43,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:43,020 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:43,111 INFO L93 Difference]: Finished difference Result 217 states and 260 transitions. [2025-03-04 07:34:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:34:43,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 07:34:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:43,113 INFO L225 Difference]: With dead ends: 217 [2025-03-04 07:34:43,113 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 07:34:43,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:34:43,114 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 18 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:43,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 07:34:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-03-04 07:34:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.435483870967742) internal successors, (178), 166 states have internal predecessors, (178), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:34:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-03-04 07:34:43,122 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 22 [2025-03-04 07:34:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-03-04 07:34:43,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-03-04 07:34:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:34:43,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:43,123 INFO L218 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] [2025-03-04 07:34:43,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:34:43,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1744966729, now seen corresponding path program 1 times [2025-03-04 07:34:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:43,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229149206] [2025-03-04 07:34:43,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:43,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:34:43,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:34:43,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:43,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229149206] [2025-03-04 07:34:43,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229149206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017864437] [2025-03-04 07:34:43,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:43,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:43,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:43,355 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) [2025-03-04 07:34:43,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:34:43,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:34:43,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:34:43,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:43,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:34:43,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:43,487 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 [2025-03-04 07:34:43,536 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 15 [2025-03-04 07:34:43,542 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 31 treesize of output 15 [2025-03-04 07:34:43,578 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 21 treesize of output 9 [2025-03-04 07:34:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:43,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:34:43,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017864437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:43,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:34:43,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-04 07:34:43,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358850485] [2025-03-04 07:34:43,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:43,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:34:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:43,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:34:43,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:34:43,593 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:43,839 INFO L93 Difference]: Finished difference Result 213 states and 260 transitions. [2025-03-04 07:34:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:34:43,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 07:34:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:43,841 INFO L225 Difference]: With dead ends: 213 [2025-03-04 07:34:43,841 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 07:34:43,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:34:43,842 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:43,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1295 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 07:34:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2025-03-04 07:34:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 165 states have internal predecessors, (177), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:34:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2025-03-04 07:34:43,850 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 23 [2025-03-04 07:34:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:43,850 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2025-03-04 07:34:43,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2025-03-04 07:34:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:34:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:43,851 INFO L218 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] [2025-03-04 07:34:43,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:34:44,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:44,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:44,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1744966730, now seen corresponding path program 1 times [2025-03-04 07:34:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109695440] [2025-03-04 07:34:44,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:44,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:34:44,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:34:44,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:44,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109695440] [2025-03-04 07:34:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109695440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976436685] [2025-03-04 07:34:44,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:44,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:44,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:44,262 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) [2025-03-04 07:34:44,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:34:44,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 07:34:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:34:44,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:44,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:44,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:34:44,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:44,390 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 [2025-03-04 07:34:44,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:34:44,504 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 47 treesize of output 29 [2025-03-04 07:34:44,508 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 38 treesize of output 26 [2025-03-04 07:34:44,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-03-04 07:34:44,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-03-04 07:34:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-04 07:34:44,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-04 07:34:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:44,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:34:44,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976436685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:44,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:34:44,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-03-04 07:34:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775151766] [2025-03-04 07:34:44,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:34:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:44,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:34:44,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:34:44,620 INFO L87 Difference]: Start difference. First operand 208 states and 251 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:44,996 INFO L93 Difference]: Finished difference Result 212 states and 259 transitions. [2025-03-04 07:34:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:34:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 07:34:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:45,001 INFO L225 Difference]: With dead ends: 212 [2025-03-04 07:34:45,001 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 07:34:45,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:34:45,015 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 14 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:45,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1447 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 07:34:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2025-03-04 07:34:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 164 states have internal predecessors, (176), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:34:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2025-03-04 07:34:45,025 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 23 [2025-03-04 07:34:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:45,025 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2025-03-04 07:34:45,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2025-03-04 07:34:45,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:34:45,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:45,026 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:34:45,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:34:45,230 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,SelfDestructingSolverStorable9 [2025-03-04 07:34:45,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:45,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 150088281, now seen corresponding path program 1 times [2025-03-04 07:34:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136804061] [2025-03-04 07:34:45,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:45,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:34:45,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:34:45,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:45,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:34:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136804061] [2025-03-04 07:34:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136804061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297076679] [2025-03-04 07:34:45,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:45,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:45,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:45,445 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) [2025-03-04 07:34:45,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:34:45,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:34:45,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:34:45,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:45,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:45,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:34:45,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:45,579 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 12 treesize of output 11 [2025-03-04 07:34:45,602 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 [2025-03-04 07:34:45,605 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 [2025-03-04 07:34:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:34:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:45,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:34:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297076679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:45,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:34:45,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-04 07:34:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727797354] [2025-03-04 07:34:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:45,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:34:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:45,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:34:45,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:34:45,690 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:45,955 INFO L93 Difference]: Finished difference Result 215 states and 256 transitions. [2025-03-04 07:34:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:34:45,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-04 07:34:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:45,960 INFO L225 Difference]: With dead ends: 215 [2025-03-04 07:34:45,960 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 07:34:45,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:34:45,960 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 28 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:45,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1204 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 07:34:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2025-03-04 07:34:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 163 states have internal predecessors, (173), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2025-03-04 07:34:45,973 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 35 [2025-03-04 07:34:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:45,973 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2025-03-04 07:34:45,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:34:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2025-03-04 07:34:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:34:45,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:45,974 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 07:34:45,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:34:46,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:46,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:46,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1173037684, now seen corresponding path program 1 times [2025-03-04 07:34:46,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364970491] [2025-03-04 07:34:46,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:34:46,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:34:46,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:46,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:46,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364970491] [2025-03-04 07:34:46,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364970491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:46,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:46,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106887218] [2025-03-04 07:34:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:46,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:34:46,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:46,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:34:46,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:46,264 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,304 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2025-03-04 07:34:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:34:46,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-04 07:34:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,306 INFO L225 Difference]: With dead ends: 216 [2025-03-04 07:34:46,306 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 07:34:46,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:34:46,306 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 22 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 768 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:34:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 07:34:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2025-03-04 07:34:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 163 states have internal predecessors, (172), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 242 transitions. [2025-03-04 07:34:46,318 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 242 transitions. Word has length 36 [2025-03-04 07:34:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 242 transitions. [2025-03-04 07:34:46,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 242 transitions. [2025-03-04 07:34:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:34:46,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,320 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:46,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:34:46,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:46,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1722566853, now seen corresponding path program 1 times [2025-03-04 07:34:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345089298] [2025-03-04 07:34:46,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:34:46,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:34:46,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:34:46,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345089298] [2025-03-04 07:34:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345089298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:46,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:46,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:34:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540883628] [2025-03-04 07:34:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:46,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:34:46,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:46,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:34:46,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:46,413 INFO L87 Difference]: Start difference. First operand 206 states and 242 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,543 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2025-03-04 07:34:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:34:46,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-04 07:34:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,545 INFO L225 Difference]: With dead ends: 204 [2025-03-04 07:34:46,546 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 07:34:46,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:34:46,547 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 764 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 07:34:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 07:34:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 161 states have internal predecessors, (170), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2025-03-04 07:34:46,554 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 44 [2025-03-04 07:34:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,555 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2025-03-04 07:34:46,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2025-03-04 07:34:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:34:46,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:46,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:34:46,557 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:46,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1722566852, now seen corresponding path program 1 times [2025-03-04 07:34:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783006433] [2025-03-04 07:34:46,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:34:46,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:34:46,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:46,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783006433] [2025-03-04 07:34:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783006433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:46,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:34:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011769913] [2025-03-04 07:34:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:34:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:46,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:34:46,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:46,732 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:46,875 INFO L93 Difference]: Finished difference Result 202 states and 238 transitions. [2025-03-04 07:34:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:34:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-04 07:34:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:46,876 INFO L225 Difference]: With dead ends: 202 [2025-03-04 07:34:46,876 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 07:34:46,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:34:46,877 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:46,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 955 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:34:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 07:34:46,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-04 07:34:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 123 states have (on average 1.3658536585365855) internal successors, (168), 159 states have internal predecessors, (168), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2025-03-04 07:34:46,884 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 44 [2025-03-04 07:34:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:46,885 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2025-03-04 07:34:46,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2025-03-04 07:34:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:34:46,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:46,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:46,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:34:46,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:46,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1859964745, now seen corresponding path program 1 times [2025-03-04 07:34:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:46,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655349339] [2025-03-04 07:34:46,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:46,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:34:46,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:34:46,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:46,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:47,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655349339] [2025-03-04 07:34:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655349339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:47,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714943101] [2025-03-04 07:34:47,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:47,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:47,103 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) [2025-03-04 07:34:47,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:34:47,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:34:47,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:34:47,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:47,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:47,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:34:47,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:47,226 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 [2025-03-04 07:34:47,253 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 15 [2025-03-04 07:34:47,257 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 31 treesize of output 15 [2025-03-04 07:34:47,290 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 21 treesize of output 9 [2025-03-04 07:34:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:34:47,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:34:47,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714943101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:47,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:34:47,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-04 07:34:47,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430536292] [2025-03-04 07:34:47,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:47,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:34:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:47,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:34:47,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:34:47,306 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:47,522 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2025-03-04 07:34:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:34:47,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 07:34:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:47,523 INFO L225 Difference]: With dead ends: 206 [2025-03-04 07:34:47,523 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 07:34:47,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:34:47,524 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 10 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:47,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1262 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:34:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 07:34:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2025-03-04 07:34:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 158 states have internal predecessors, (167), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 237 transitions. [2025-03-04 07:34:47,529 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 237 transitions. Word has length 45 [2025-03-04 07:34:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:47,529 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 237 transitions. [2025-03-04 07:34:47,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 237 transitions. [2025-03-04 07:34:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:34:47,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:47,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:47,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:34:47,735 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,SelfDestructingSolverStorable14 [2025-03-04 07:34:47,735 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:47,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:47,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1859964744, now seen corresponding path program 1 times [2025-03-04 07:34:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:47,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58297898] [2025-03-04 07:34:47,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:47,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:47,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:34:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:34:47,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:47,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:47,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:47,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58297898] [2025-03-04 07:34:47,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58297898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:47,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785789491] [2025-03-04 07:34:47,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:47,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:47,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:47,950 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) [2025-03-04 07:34:47,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:34:48,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:34:48,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:34:48,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:48,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:48,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:34:48,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:48,116 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 [2025-03-04 07:34:48,118 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 [2025-03-04 07:34:48,200 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 47 treesize of output 29 [2025-03-04 07:34:48,204 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 38 treesize of output 26 [2025-03-04 07:34:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-03-04 07:34:48,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-03-04 07:34:48,267 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 29 treesize of output 17 [2025-03-04 07:34:48,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-04 07:34:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:48,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:34:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785789491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:34:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-03-04 07:34:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326760307] [2025-03-04 07:34:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:48,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:34:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:48,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:34:48,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:34:48,289 INFO L87 Difference]: Start difference. First operand 201 states and 237 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:48,625 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2025-03-04 07:34:48,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:34:48,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 07:34:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:48,626 INFO L225 Difference]: With dead ends: 205 [2025-03-04 07:34:48,626 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 07:34:48,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:34:48,627 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 23 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:48,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1578 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 07:34:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-03-04 07:34:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 123 states have (on average 1.3495934959349594) internal successors, (166), 157 states have internal predecessors, (166), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:34:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2025-03-04 07:34:48,632 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 45 [2025-03-04 07:34:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:48,632 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2025-03-04 07:34:48,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:34:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2025-03-04 07:34:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:34:48,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:48,633 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:48,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:34:48,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:34:48,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:48,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:48,834 INFO L85 PathProgramCache]: Analyzing trace with hash -507269477, now seen corresponding path program 1 times [2025-03-04 07:34:48,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:48,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047195615] [2025-03-04 07:34:48,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:48,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:34:48,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:34:48,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:48,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:49,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:49,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047195615] [2025-03-04 07:34:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047195615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:49,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169958577] [2025-03-04 07:34:49,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:49,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:49,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:49,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:34:49,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:34:49,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:34:49,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:34:49,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:49,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:49,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:34:49,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:49,514 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 [2025-03-04 07:34:49,534 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 17 [2025-03-04 07:34:49,654 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-04 07:34:49,654 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 2 case distinctions, treesize of input 17 treesize of output 18 [2025-03-04 07:34:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:49,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:34:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169958577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:49,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:34:49,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 25 [2025-03-04 07:34:49,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572534410] [2025-03-04 07:34:49,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:49,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:34:49,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:49,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:34:49,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:34:49,737 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:34:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:50,913 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2025-03-04 07:34:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:34:50,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2025-03-04 07:34:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:50,915 INFO L225 Difference]: With dead ends: 253 [2025-03-04 07:34:50,915 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 07:34:50,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:34:50,918 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 638 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 427 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:50,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 876 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1272 Invalid, 23 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:34:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 07:34:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2025-03-04 07:34:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 142 states have (on average 1.352112676056338) internal successors, (192), 176 states have internal predecessors, (192), 40 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2025-03-04 07:34:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2025-03-04 07:34:50,926 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 52 [2025-03-04 07:34:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:50,927 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2025-03-04 07:34:50,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:34:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2025-03-04 07:34:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 07:34:50,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:50,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:50,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:34:51,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 07:34:51,130 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:51,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash -507269476, now seen corresponding path program 1 times [2025-03-04 07:34:51,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:51,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042408601] [2025-03-04 07:34:51,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:51,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:51,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:34:51,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:34:51,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:51,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042408601] [2025-03-04 07:34:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042408601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630959418] [2025-03-04 07:34:52,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:52,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:52,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:34:52,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:34:52,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 07:34:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 07:34:52,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:52,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 07:34:52,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:52,695 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 [2025-03-04 07:34:52,740 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 49 treesize of output 25 [2025-03-04 07:34:52,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:34:52,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:34:52,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:34:52,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-03-04 07:34:52,910 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-04 07:34:52,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-03-04 07:34:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:34:53,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630959418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:53,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:34:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2025-03-04 07:34:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272284905] [2025-03-04 07:34:53,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:53,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 07:34:53,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:53,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 07:34:53,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1652, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 07:34:53,357 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 37 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 30 states have internal predecessors, (90), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:34:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:55,479 INFO L93 Difference]: Finished difference Result 267 states and 323 transitions. [2025-03-04 07:34:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:34:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 30 states have internal predecessors, (90), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2025-03-04 07:34:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:55,482 INFO L225 Difference]: With dead ends: 267 [2025-03-04 07:34:55,482 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 07:34:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=315, Invalid=2877, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 07:34:55,483 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 208 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 97 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:55,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1552 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2485 Invalid, 11 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 07:34:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 07:34:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 233. [2025-03-04 07:34:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 181 states have internal predecessors, (195), 41 states have call successors, (41), 13 states have call predecessors, (41), 14 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2025-03-04 07:34:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2025-03-04 07:34:55,493 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 52 [2025-03-04 07:34:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2025-03-04 07:34:55,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 30 states have internal predecessors, (90), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:34:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2025-03-04 07:34:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 07:34:55,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:55,494 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:55,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:34:55,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:55,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:55,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash 80266030, now seen corresponding path program 1 times [2025-03-04 07:34:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881810624] [2025-03-04 07:34:55,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:55,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:55,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 07:34:55,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:34:55,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:34:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881810624] [2025-03-04 07:34:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881810624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:34:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224147753] [2025-03-04 07:34:55,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:34:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:55,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:34:55,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:34:55,868 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:34:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:56,164 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2025-03-04 07:34:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:34:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-03-04 07:34:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:56,165 INFO L225 Difference]: With dead ends: 254 [2025-03-04 07:34:56,165 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 07:34:56,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:34:56,166 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 57 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:56,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1187 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 07:34:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2025-03-04 07:34:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 187 states have internal predecessors, (203), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-03-04 07:34:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 290 transitions. [2025-03-04 07:34:56,174 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 290 transitions. Word has length 59 [2025-03-04 07:34:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:56,174 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 290 transitions. [2025-03-04 07:34:56,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:34:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 290 transitions. [2025-03-04 07:34:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 07:34:56,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:56,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:56,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:34:56,175 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:56,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash 80266031, now seen corresponding path program 1 times [2025-03-04 07:34:56,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:56,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756179112] [2025-03-04 07:34:56,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:56,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:56,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 07:34:56,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 07:34:56,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:56,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:34:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756179112] [2025-03-04 07:34:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756179112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:34:56,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:34:56,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:34:56,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513630442] [2025-03-04 07:34:56,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:34:56,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:34:56,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:56,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:34:56,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:34:56,434 INFO L87 Difference]: Start difference. First operand 241 states and 290 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:34:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:56,755 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2025-03-04 07:34:56,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:34:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-03-04 07:34:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:56,757 INFO L225 Difference]: With dead ends: 255 [2025-03-04 07:34:56,757 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 07:34:56,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:34:56,758 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 58 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:56,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1386 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 07:34:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2025-03-04 07:34:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 187 states have internal predecessors, (202), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-03-04 07:34:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 289 transitions. [2025-03-04 07:34:56,764 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 289 transitions. Word has length 59 [2025-03-04 07:34:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:56,764 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 289 transitions. [2025-03-04 07:34:56,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:34:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 289 transitions. [2025-03-04 07:34:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 07:34:56,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:56,764 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:56,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:34:56,764 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:56,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:56,765 INFO L85 PathProgramCache]: Analyzing trace with hash 455159894, now seen corresponding path program 1 times [2025-03-04 07:34:56,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:56,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068875498] [2025-03-04 07:34:56,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:56,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:56,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:34:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:34:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 07:34:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068875498] [2025-03-04 07:34:56,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068875498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:56,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573034752] [2025-03-04 07:34:56,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:56,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:56,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:56,901 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:34:56,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:34:57,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:34:57,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:34:57,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:57,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:57,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:34:57,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:34:57,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:57,129 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:34:57,130 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 12 treesize of output 11 [2025-03-04 07:34:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:34:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573034752] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:57,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2025-03-04 07:34:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436402738] [2025-03-04 07:34:57,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:57,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:34:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:57,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:34:57,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:34:57,146 INFO L87 Difference]: Start difference. First operand 241 states and 289 transitions. Second operand has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:34:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:57,524 INFO L93 Difference]: Finished difference Result 265 states and 317 transitions. [2025-03-04 07:34:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:34:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-03-04 07:34:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:57,525 INFO L225 Difference]: With dead ends: 265 [2025-03-04 07:34:57,525 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 07:34:57,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:34:57,525 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 102 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:57,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1273 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:34:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 07:34:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 242. [2025-03-04 07:34:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 187 states have internal predecessors, (204), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-03-04 07:34:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2025-03-04 07:34:57,531 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 69 [2025-03-04 07:34:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:57,531 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2025-03-04 07:34:57,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:34:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2025-03-04 07:34:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 07:34:57,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:57,534 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:57,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:34:57,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:34:57,735 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:34:57,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:34:57,735 INFO L85 PathProgramCache]: Analyzing trace with hash 455159895, now seen corresponding path program 1 times [2025-03-04 07:34:57,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:34:57,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849003448] [2025-03-04 07:34:57,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:34:57,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:34:57,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:34:57,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:57,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:34:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:34:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849003448] [2025-03-04 07:34:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849003448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:34:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510013823] [2025-03-04 07:34:58,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:34:58,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:34:58,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:34:58,078 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:34:58,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:34:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:34:58,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:34:58,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:34:58,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:34:58,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 07:34:58,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:34:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:34:58,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:34:58,596 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 7 treesize of output 5 [2025-03-04 07:34:58,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:34:58,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-03-04 07:34:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:34:58,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510013823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:34:58,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:34:58,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 38 [2025-03-04 07:34:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892179684] [2025-03-04 07:34:58,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:34:58,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:34:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:34:58,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:34:58,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:34:58,784 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand has 39 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 27 states have internal predecessors, (116), 12 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 07:34:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:34:59,917 INFO L93 Difference]: Finished difference Result 381 states and 468 transitions. [2025-03-04 07:34:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:34:59,918 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 27 states have internal predecessors, (116), 12 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) Word has length 69 [2025-03-04 07:34:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:34:59,920 INFO L225 Difference]: With dead ends: 381 [2025-03-04 07:34:59,920 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 07:34:59,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 07:34:59,924 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 399 mSDsluCounter, 5753 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 6055 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:34:59,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 6055 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:34:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 07:34:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 337. [2025-03-04 07:34:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 213 states have (on average 1.3943661971830985) internal successors, (297), 249 states have internal predecessors, (297), 74 states have call successors, (74), 18 states have call predecessors, (74), 19 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-03-04 07:34:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 449 transitions. [2025-03-04 07:34:59,934 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 449 transitions. Word has length 69 [2025-03-04 07:34:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:34:59,934 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 449 transitions. [2025-03-04 07:34:59,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 27 states have internal predecessors, (116), 12 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 07:34:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 449 transitions. [2025-03-04 07:34:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 07:34:59,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:34:59,935 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:34:59,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:00,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:00,136 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:00,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1373890836, now seen corresponding path program 2 times [2025-03-04 07:35:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:00,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102125544] [2025-03-04 07:35:00,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:35:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:00,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-04 07:35:00,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 76 statements. [2025-03-04 07:35:00,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:35:00,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 07:35:00,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102125544] [2025-03-04 07:35:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102125544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:00,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:00,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:35:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672545223] [2025-03-04 07:35:00,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:00,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:35:00,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:00,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:35:00,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:35:00,312 INFO L87 Difference]: Start difference. First operand 337 states and 449 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:35:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:00,436 INFO L93 Difference]: Finished difference Result 340 states and 452 transitions. [2025-03-04 07:35:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:35:00,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2025-03-04 07:35:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:00,438 INFO L225 Difference]: With dead ends: 340 [2025-03-04 07:35:00,438 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 07:35:00,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:35:00,439 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:00,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 980 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:35:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 07:35:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2025-03-04 07:35:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 215 states have (on average 1.3906976744186046) internal successors, (299), 251 states have internal predecessors, (299), 74 states have call successors, (74), 18 states have call predecessors, (74), 19 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-03-04 07:35:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 451 transitions. [2025-03-04 07:35:00,445 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 451 transitions. Word has length 76 [2025-03-04 07:35:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 451 transitions. [2025-03-04 07:35:00,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:35:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 451 transitions. [2025-03-04 07:35:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 07:35:00,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:00,445 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:00,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:35:00,446 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:00,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1075260461, now seen corresponding path program 3 times [2025-03-04 07:35:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:00,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102799675] [2025-03-04 07:35:00,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:35:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:00,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-03-04 07:35:00,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-03-04 07:35:00,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:35:00,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:35:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102799675] [2025-03-04 07:35:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102799675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113103814] [2025-03-04 07:35:01,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:35:01,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:01,242 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:01,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:35:01,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-03-04 07:35:01,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-03-04 07:35:01,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:35:01,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:01,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 07:35:01,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:01,447 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 [2025-03-04 07:35:01,449 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 [2025-03-04 07:35:01,473 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:35:01,473 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 [2025-03-04 07:35:01,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:35:01,483 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 [2025-03-04 07:35:01,501 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 [2025-03-04 07:35:01,524 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 20 treesize of output 8 [2025-03-04 07:35:01,727 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 [2025-03-04 07:35:01,757 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 49 treesize of output 25 [2025-03-04 07:35:01,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:35:01,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:35:01,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:35:01,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-04 07:35:01,901 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-04 07:35:01,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-03-04 07:35:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:35:02,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113103814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:02,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:35:02,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 40 [2025-03-04 07:35:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599334989] [2025-03-04 07:35:02,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:02,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:35:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:02,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:35:02,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2110, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 07:35:02,752 INFO L87 Difference]: Start difference. First operand 339 states and 451 transitions. Second operand has 40 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:35:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:05,971 INFO L93 Difference]: Finished difference Result 381 states and 504 transitions. [2025-03-04 07:35:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 07:35:05,972 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 77 [2025-03-04 07:35:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:05,973 INFO L225 Difference]: With dead ends: 381 [2025-03-04 07:35:05,973 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 07:35:05,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=398, Invalid=5152, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 07:35:05,974 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 364 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 5164 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 5325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 5164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:05,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2282 Invalid, 5325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 5164 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 07:35:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 07:35:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 342. [2025-03-04 07:35:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 218 states have (on average 1.371559633027523) internal successors, (299), 254 states have internal predecessors, (299), 74 states have call successors, (74), 18 states have call predecessors, (74), 20 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-03-04 07:35:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 451 transitions. [2025-03-04 07:35:05,983 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 451 transitions. Word has length 77 [2025-03-04 07:35:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:05,983 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 451 transitions. [2025-03-04 07:35:05,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:35:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 451 transitions. [2025-03-04 07:35:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 07:35:05,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:05,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:05,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:06,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:35:06,185 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:06,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash -958372097, now seen corresponding path program 1 times [2025-03-04 07:35:06,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:06,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922785921] [2025-03-04 07:35:06,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:06,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 07:35:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 07:35:06,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 07:35:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922785921] [2025-03-04 07:35:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922785921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:35:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728887556] [2025-03-04 07:35:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:35:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:06,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:35:06,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:35:06,241 INFO L87 Difference]: Start difference. First operand 342 states and 451 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:35:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:06,246 INFO L93 Difference]: Finished difference Result 345 states and 451 transitions. [2025-03-04 07:35:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:35:06,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 77 [2025-03-04 07:35:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:06,248 INFO L225 Difference]: With dead ends: 345 [2025-03-04 07:35:06,248 INFO L226 Difference]: Without dead ends: 342 [2025-03-04 07:35:06,248 INFO L434 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 [2025-03-04 07:35:06,248 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:06,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:35:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-04 07:35:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-04 07:35:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 218 states have (on average 1.3577981651376148) internal successors, (296), 254 states have internal predecessors, (296), 74 states have call successors, (74), 18 states have call predecessors, (74), 20 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-03-04 07:35:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 448 transitions. [2025-03-04 07:35:06,258 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 448 transitions. Word has length 77 [2025-03-04 07:35:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:06,258 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 448 transitions. [2025-03-04 07:35:06,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 07:35:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 448 transitions. [2025-03-04 07:35:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 07:35:06,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:06,259 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:06,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 07:35:06,259 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:06,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1818443373, now seen corresponding path program 1 times [2025-03-04 07:35:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:06,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621186919] [2025-03-04 07:35:06,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:06,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 07:35:06,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 07:35:06,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:06,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 07:35:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621186919] [2025-03-04 07:35:06,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621186919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75087854] [2025-03-04 07:35:06,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:06,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:06,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:06,468 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:06,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:35:06,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 07:35:06,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 07:35:06,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:06,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:06,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:35:06,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:06,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 [2025-03-04 07:35:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 07:35:06,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75087854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:06,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:35:06,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2025-03-04 07:35:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126478605] [2025-03-04 07:35:06,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:06,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:35:06,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:06,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:35:06,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:35:06,848 INFO L87 Difference]: Start difference. First operand 342 states and 448 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:35:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:07,036 INFO L93 Difference]: Finished difference Result 340 states and 438 transitions. [2025-03-04 07:35:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:35:07,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2025-03-04 07:35:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:07,038 INFO L225 Difference]: With dead ends: 340 [2025-03-04 07:35:07,038 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 07:35:07,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:35:07,039 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 55 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:07,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1030 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:35:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 07:35:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 329. [2025-03-04 07:35:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 244 states have internal predecessors, (282), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-04 07:35:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 426 transitions. [2025-03-04 07:35:07,047 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 426 transitions. Word has length 84 [2025-03-04 07:35:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:07,047 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 426 transitions. [2025-03-04 07:35:07,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:35:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 426 transitions. [2025-03-04 07:35:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 07:35:07,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:07,048 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:07,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:07,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:35:07,249 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2127748312, now seen corresponding path program 1 times [2025-03-04 07:35:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997740940] [2025-03-04 07:35:07,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:07,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 07:35:07,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 07:35:07,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:07,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-04 07:35:07,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:07,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997740940] [2025-03-04 07:35:07,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997740940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:07,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312706304] [2025-03-04 07:35:07,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:07,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:07,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:35:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 07:35:07,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 07:35:07,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:07,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:07,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 07:35:07,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:07,652 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 [2025-03-04 07:35:07,679 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 15 [2025-03-04 07:35:07,682 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 31 treesize of output 15 [2025-03-04 07:35:07,711 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 31 treesize of output 15 [2025-03-04 07:35:07,966 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 21 treesize of output 9 [2025-03-04 07:35:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-04 07:35:07,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:08,098 INFO L349 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2025-03-04 07:35:08,099 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 18 treesize of output 17 [2025-03-04 07:35:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-04 07:35:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312706304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:08,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:35:08,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 20 [2025-03-04 07:35:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766987600] [2025-03-04 07:35:08,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:35:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:08,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:35:08,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:35:08,106 INFO L87 Difference]: Start difference. First operand 329 states and 426 transitions. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 07:35:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:09,040 INFO L93 Difference]: Finished difference Result 405 states and 541 transitions. [2025-03-04 07:35:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 07:35:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) Word has length 101 [2025-03-04 07:35:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:09,042 INFO L225 Difference]: With dead ends: 405 [2025-03-04 07:35:09,042 INFO L226 Difference]: Without dead ends: 399 [2025-03-04 07:35:09,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 180 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:35:09,043 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 144 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:09,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2520 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:35:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-04 07:35:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 330. [2025-03-04 07:35:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 210 states have (on average 1.3428571428571427) internal successors, (282), 245 states have internal predecessors, (282), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-04 07:35:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 426 transitions. [2025-03-04 07:35:09,050 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 426 transitions. Word has length 101 [2025-03-04 07:35:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:09,050 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 426 transitions. [2025-03-04 07:35:09,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-04 07:35:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 426 transitions. [2025-03-04 07:35:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 07:35:09,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:09,051 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:09,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:35:09,252 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFexgcdErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1375032582, now seen corresponding path program 1 times [2025-03-04 07:35:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252880290] [2025-03-04 07:35:09,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:09,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 07:35:09,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 07:35:09,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:09,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-04 07:35:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252880290] [2025-03-04 07:35:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252880290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446182331] [2025-03-04 07:35:09,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:09,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:09,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:09,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:09,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:35:09,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 07:35:09,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 07:35:09,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:09,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:09,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-04 07:35:09,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:09,748 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 [2025-03-04 07:35:09,750 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 [2025-03-04 07:35:09,835 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 47 treesize of output 29 [2025-03-04 07:35:09,839 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 38 treesize of output 26 [2025-03-04 07:35:09,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-03-04 07:35:09,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-03-04 07:35:09,901 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 39 treesize of output 23 [2025-03-04 07:35:09,903 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 48 treesize of output 26 [2025-03-04 07:35:10,411 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 29 treesize of output 17 [2025-03-04 07:35:10,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-04 07:35:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 07:35:10,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:10,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:35:10,931 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 37 treesize of output 41 [2025-03-04 07:35:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-04 07:35:11,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446182331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:11,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:35:11,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 38 [2025-03-04 07:35:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420762423] [2025-03-04 07:35:11,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:11,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 07:35:11,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:11,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 07:35:11,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:35:11,093 INFO L87 Difference]: Start difference. First operand 330 states and 426 transitions. Second operand has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 32 states have internal predecessors, (139), 8 states have call successors, (25), 7 states have call predecessors, (25), 5 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-04 07:35:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:12,699 INFO L93 Difference]: Finished difference Result 367 states and 479 transitions. [2025-03-04 07:35:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 07:35:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 32 states have internal predecessors, (139), 8 states have call successors, (25), 7 states have call predecessors, (25), 5 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) Word has length 102 [2025-03-04 07:35:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:12,700 INFO L225 Difference]: With dead ends: 367 [2025-03-04 07:35:12,701 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 07:35:12,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 165 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=500, Invalid=3790, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 07:35:12,702 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 259 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:12,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 2414 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:35:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 07:35:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 331. [2025-03-04 07:35:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 211 states have (on average 1.3364928909952607) internal successors, (282), 246 states have internal predecessors, (282), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-04 07:35:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 426 transitions. [2025-03-04 07:35:12,708 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 426 transitions. Word has length 102 [2025-03-04 07:35:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:12,709 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 426 transitions. [2025-03-04 07:35:12,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 32 states have internal predecessors, (139), 8 states have call successors, (25), 7 states have call predecessors, (25), 5 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-04 07:35:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 426 transitions. [2025-03-04 07:35:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 07:35:12,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:12,710 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:12,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:12,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 07:35:12,910 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:12,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash 256701787, now seen corresponding path program 1 times [2025-03-04 07:35:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563029000] [2025-03-04 07:35:12,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:12,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:12,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 07:35:12,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 07:35:12,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:12,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-04 07:35:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563029000] [2025-03-04 07:35:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563029000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980537247] [2025-03-04 07:35:13,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:13,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:13,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:13,174 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:13,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:35:13,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 07:35:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 07:35:13,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:13,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:13,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:35:13,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-04 07:35:13,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 07:35:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980537247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:13,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:35:13,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-03-04 07:35:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041353523] [2025-03-04 07:35:13,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:13,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:35:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:13,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:35:13,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:35:13,662 INFO L87 Difference]: Start difference. First operand 331 states and 426 transitions. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 07:35:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:14,025 INFO L93 Difference]: Finished difference Result 357 states and 469 transitions. [2025-03-04 07:35:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:35:14,026 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2025-03-04 07:35:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:14,028 INFO L225 Difference]: With dead ends: 357 [2025-03-04 07:35:14,028 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 07:35:14,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:35:14,028 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 88 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:14,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1477 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:35:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 07:35:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2025-03-04 07:35:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 221 states have (on average 1.334841628959276) internal successors, (295), 256 states have internal predecessors, (295), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-04 07:35:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 439 transitions. [2025-03-04 07:35:14,041 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 439 transitions. Word has length 111 [2025-03-04 07:35:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:14,041 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 439 transitions. [2025-03-04 07:35:14,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 07:35:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 439 transitions. [2025-03-04 07:35:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 07:35:14,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:14,042 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:14,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:35:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:14,243 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:14,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash 299210668, now seen corresponding path program 2 times [2025-03-04 07:35:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967440232] [2025-03-04 07:35:14,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:35:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:14,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-04 07:35:14,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 07:35:14,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:35:14,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 07:35:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967440232] [2025-03-04 07:35:14,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967440232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295804529] [2025-03-04 07:35:14,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:35:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:14,778 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:14,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:35:14,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-04 07:35:15,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 07:35:15,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:35:15,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:15,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:35:15,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 07:35:15,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-04 07:35:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295804529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:15,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:35:15,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 22 [2025-03-04 07:35:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128972129] [2025-03-04 07:35:15,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:15,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:35:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:15,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:35:15,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:35:15,236 INFO L87 Difference]: Start difference. First operand 341 states and 439 transitions. Second operand has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 07:35:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:15,766 INFO L93 Difference]: Finished difference Result 358 states and 464 transitions. [2025-03-04 07:35:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:35:15,767 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-04 07:35:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:15,768 INFO L225 Difference]: With dead ends: 358 [2025-03-04 07:35:15,768 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 07:35:15,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:35:15,769 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 107 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:15,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1255 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:35:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 07:35:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 343. [2025-03-04 07:35:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 223 states have (on average 1.3228699551569507) internal successors, (295), 258 states have internal predecessors, (295), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-04 07:35:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 439 transitions. [2025-03-04 07:35:15,776 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 439 transitions. Word has length 116 [2025-03-04 07:35:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:15,777 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 439 transitions. [2025-03-04 07:35:15,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 07:35:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 439 transitions. [2025-03-04 07:35:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 07:35:15,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:15,778 INFO L218 NwaCegarLoop]: trace histogram [14, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:15,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:35:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:15,978 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1629599596, now seen corresponding path program 3 times [2025-03-04 07:35:15,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:15,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155792644] [2025-03-04 07:35:15,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:35:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:15,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 120 statements into 6 equivalence classes. [2025-03-04 07:35:16,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 116 of 120 statements. [2025-03-04 07:35:16,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 07:35:16,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 77 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 07:35:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:35:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155792644] [2025-03-04 07:35:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155792644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:35:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802190475] [2025-03-04 07:35:16,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:35:16,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:16,344 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:16,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:35:16,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 120 statements into 6 equivalence classes. [2025-03-04 07:35:18,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 116 of 120 statements. [2025-03-04 07:35:18,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 07:35:18,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:18,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:35:18,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 77 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 07:35:18,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-04 07:35:19,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802190475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:19,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:35:19,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-03-04 07:35:19,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392323076] [2025-03-04 07:35:19,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:19,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:35:19,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:35:19,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:35:19,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:35:19,086 INFO L87 Difference]: Start difference. First operand 343 states and 439 transitions. Second operand has 30 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 07:35:32,059 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 46 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 07:35:40,240 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 40 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 07:35:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:44,622 INFO L93 Difference]: Finished difference Result 373 states and 491 transitions. [2025-03-04 07:35:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:35:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-03-04 07:35:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:44,624 INFO L225 Difference]: With dead ends: 373 [2025-03-04 07:35:44,624 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 07:35:44,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=744, Invalid=2011, Unknown=1, NotChecked=0, Total=2756 [2025-03-04 07:35:44,625 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 163 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:44,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 2159 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:35:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 07:35:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2025-03-04 07:35:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 269 states have internal predecessors, (309), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-04 07:35:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 453 transitions. [2025-03-04 07:35:44,634 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 453 transitions. Word has length 120 [2025-03-04 07:35:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:44,634 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 453 transitions. [2025-03-04 07:35:44,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 07:35:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 453 transitions. [2025-03-04 07:35:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 07:35:44,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:44,635 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:44,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:35:44,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:44,836 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:44,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1413094644, now seen corresponding path program 4 times [2025-03-04 07:35:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:35:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074727269] [2025-03-04 07:35:44,837 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:35:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:35:44,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-04 07:35:44,954 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 07:35:44,954 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 07:35:44,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:35:44,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:35:44,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 07:35:45,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 07:35:45,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:45,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:35:45,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:35:45,044 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:35:45,044 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2025-03-04 07:35:45,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2025-03-04 07:35:45,047 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2025-03-04 07:35:45,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2025-03-04 07:35:45,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2025-03-04 07:35:45,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 07:35:45,051 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:45,096 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:35:45,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:35:45 BoogieIcfgContainer [2025-03-04 07:35:45,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:35:45,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:35:45,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:35:45,099 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:35:45,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:34:40" (3/4) ... [2025-03-04 07:35:45,103 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:35:45,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:35:45,104 INFO L158 Benchmark]: Toolchain (without parser) took 65858.16ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 103.8MB in the beginning and 140.1MB in the end (delta: -36.2MB). Peak memory consumption was 224.5MB. Max. memory is 16.1GB. [2025-03-04 07:35:45,104 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:35:45,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.59ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 73.6MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 07:35:45,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.31ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:35:45,105 INFO L158 Benchmark]: Boogie Preprocessor took 60.52ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 67.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:35:45,105 INFO L158 Benchmark]: IcfgBuilder took 543.15ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 100.2MB in the end (delta: -32.3MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2025-03-04 07:35:45,105 INFO L158 Benchmark]: TraceAbstraction took 64766.75ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 99.4MB in the beginning and 140.1MB in the end (delta: -40.7MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. [2025-03-04 07:35:45,105 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 402.7MB. Free memory was 140.1MB in the beginning and 140.1MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:35:45,107 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.59ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 73.6MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.31ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.52ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 67.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 543.15ms. Allocated memory is still 142.6MB. Free memory was 67.9MB in the beginning and 100.2MB in the end (delta: -32.3MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * TraceAbstraction took 64766.75ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 99.4MB in the beginning and 140.1MB in the end (delta: -40.7MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 402.7MB. Free memory was 140.1MB in the beginning and 140.1MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 964]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 964. Possible FailurePath: [L966] DUPFF f, g, cf, cg, h; VAL [cf={14:0}, cg={15:0}] [L967] CALL, EXPR DUPFFnew(1) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=1, ans={-2:0}, maxdeg=1] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={-2:0}, maxdeg=1] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=1, ans={-2:0}, maxdeg=1] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=1, ans={-2:0}] [L901] ans->deg = -1 VAL [\old(maxdeg)=1, ans={-2:0}] [L902] return ans; VAL [\old(maxdeg)=1, \result={-2:0}] [L967] RET, EXPR DUPFFnew(1) VAL [cf={14:0}, cg={15:0}] [L967] f = DUPFFnew(1) [L967] EXPR f->coeffs [L967] f->coeffs[1] = 1 [L967] f->deg = 1 [L968] CALL, EXPR DUPFFnew(2) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=2, ans={-4:0}, maxdeg=2] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=2, ans={-4:0}, maxdeg=2] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=2, ans={-4:0}, maxdeg=2] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=2, ans={-4:0}] [L901] ans->deg = -1 VAL [\old(maxdeg)=2, ans={-4:0}] [L902] return ans; VAL [\old(maxdeg)=2, \result={-4:0}] [L968] RET, EXPR DUPFFnew(2) VAL [cf={14:0}, cg={15:0}, f={-2:0}] [L968] g = DUPFFnew(2) [L968] EXPR g->coeffs [L968] g->coeffs[2] = 1 [L968] g->deg = 2 [L969] CALL, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [\old(f)={-2:0}] [L890] EXPR f->deg VAL [\old(f)={-2:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [\old(f)={-4:0}] [L890] EXPR f->deg VAL [\old(f)={-4:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] COND TRUE DUPFFdeg(f) < DUPFFdeg(g) [L922] CALL, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}] [L890] EXPR f->deg VAL [\old(f)={-4:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [\old(f)={-2:0}] [L890] EXPR f->deg VAL [\old(f)={-2:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] COND FALSE !(DUPFFdeg(f) < DUPFFdeg(g)) [L923] CALL, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}] [L890] EXPR f->deg VAL [\old(f)={-4:0}] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] CALL, EXPR DUPFFdeg(g) VAL [\old(f)={-2:0}] [L890] EXPR f->deg VAL [\old(f)={-2:0}] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(g) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] COND FALSE !(DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1) [L924] EXPR f->coeffs VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L924] EXPR f->coeffs[0] VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L924] COND TRUE f->coeffs[0] == 0 [L924] return f; VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, \result={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] RET, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] return DUPFFexgcd(gcofac, fcofac, g, f); [L969] RET, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [cf={14:0}, cg={15:0}, f={-2:0}, g={-4:0}] [L969] h = DUPFFexgcd(&cf, &cg, f, g) [L970] h = h [L971] return 0; [L971] return 0; [L971] return 0; VAL [\result=0, f={-2:0}, g={-4:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 192 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 64.7s, OverallIterations: 32, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 41.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 2920 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2887 mSDsluCounter, 42338 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36292 mSDsCounter, 1237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22345 IncrementalHoareTripleChecker+Invalid, 23616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1237 mSolverCounterUnsat, 6046 mSDtfsCounter, 22345 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2309 GetRequests, 1650 SyntacticMatches, 33 SemanticMatches, 626 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5482 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=31, InterpolantAutomatonStates: 410, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 363 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2873 NumberOfCodeBlocks, 2802 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 3381 ConstructedInterpolants, 129 QuantifiedInterpolants, 18476 SizeOfPredicates, 119 NumberOfNonLiveVariables, 9085 ConjunctsInSsa, 661 ConjunctsInUnsatCore, 54 InterpolantComputations, 22 PerfectInterpolantSequences, 2522/2866 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 07:35:45,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20020406-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:35:46,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:35:46,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:35:46,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:35:46,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:35:46,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:35:46,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:35:46,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:35:46,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:35:46,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:35:46,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:35:46,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:35:46,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:35:46,935 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:35:46,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:35:46,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:35:46,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2025-03-04 07:35:47,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:35:47,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:35:47,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:35:47,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:35:47,147 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:35:47,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2025-03-04 07:35:48,227 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba010f592/55f7c36b63074b69915eb8cb42c94d31/FLAG2af849cf2 [2025-03-04 07:35:48,492 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:35:48,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2025-03-04 07:35:48,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba010f592/55f7c36b63074b69915eb8cb42c94d31/FLAG2af849cf2 [2025-03-04 07:35:48,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba010f592/55f7c36b63074b69915eb8cb42c94d31 [2025-03-04 07:35:48,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:35:48,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:35:48,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:35:48,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:35:48,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:35:48,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:35:48" (1/1) ... [2025-03-04 07:35:48,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d24d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:48, skipping insertion in model container [2025-03-04 07:35:48,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:35:48" (1/1) ... [2025-03-04 07:35:48,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:35:49,146 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:35:49,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:35:49,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:35:49,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:35:49,281 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:35:49,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49 WrapperNode [2025-03-04 07:35:49,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:35:49,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:35:49,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:35:49,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:35:49,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,321 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-04 07:35:49,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:35:49,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:35:49,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:35:49,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:35:49,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,330 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,357 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 2, 9, 17]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0]. The 16 writes are split as follows [2, 0, 6, 8]. [2025-03-04 07:35:49,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:35:49,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:35:49,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:35:49,385 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:35:49,390 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (1/1) ... [2025-03-04 07:35:49,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:35:49,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:49,416 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) [2025-03-04 07:35:49,418 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 [2025-03-04 07:35:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2025-03-04 07:35:49,436 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2025-03-04 07:35:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:35:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:35:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 07:35:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 07:35:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:35:49,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2025-03-04 07:35:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2025-03-04 07:35:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2025-03-04 07:35:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2025-03-04 07:35:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2025-03-04 07:35:49,437 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2025-03-04 07:35:49,437 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2025-03-04 07:35:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:35:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:35:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:35:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:35:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:35:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 07:35:49,438 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2025-03-04 07:35:49,438 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2025-03-04 07:35:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2025-03-04 07:35:49,439 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2025-03-04 07:35:49,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:35:49,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:35:49,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:35:49,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:35:49,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L890: havoc #t~mem31; [2025-03-04 07:35:50,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L966: call ULTIMATE.dealloc(main_~#cf~0#1.base, main_~#cf~0#1.offset);havoc main_~#cf~0#1.base, main_~#cf~0#1.offset;call ULTIMATE.dealloc(main_~#cg~0#1.base, main_~#cg~0#1.offset);havoc main_~#cg~0#1.base, main_~#cg~0#1.offset; [2025-03-04 07:35:50,104 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-03-04 07:35:50,104 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:35:50,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:35:50,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:35:50,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:35:50 BoogieIcfgContainer [2025-03-04 07:35:50,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:35:50,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:35:50,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:35:50,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:35:50,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:35:48" (1/3) ... [2025-03-04 07:35:50,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a36c54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:35:50, skipping insertion in model container [2025-03-04 07:35:50,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:35:49" (2/3) ... [2025-03-04 07:35:50,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a36c54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:35:50, skipping insertion in model container [2025-03-04 07:35:50,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:35:50" (3/3) ... [2025-03-04 07:35:50,124 INFO L128 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2025-03-04 07:35:50,134 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:35:50,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 20020406-1.i that has 9 procedures, 187 locations, 1 initial locations, 3 loop locations, and 55 error locations. [2025-03-04 07:35:50,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:35:50,173 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;@245663b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:35:50,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-03-04 07:35:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:35:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:35:50,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:50,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:35:50,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash 211890118, now seen corresponding path program 1 times [2025-03-04 07:35:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:50,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597977233] [2025-03-04 07:35:50,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:50,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:50,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:50,197 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) [2025-03-04 07:35:50,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:35:50,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:35:50,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:35:50,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:50,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:35:50,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:50,340 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 7 [2025-03-04 07:35:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:50,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:50,353 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:50,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597977233] [2025-03-04 07:35:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597977233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:50,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:35:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104566997] [2025-03-04 07:35:50,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:50,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:35:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:35:50,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:35:50,373 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:50,572 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-04 07:35:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:35:50,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:35:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:50,578 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:35:50,578 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:35:50,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:35:50,581 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 15 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:50,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 351 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:35:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:35:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-04 07:35:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:35:50,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-03-04 07:35:50,627 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2025-03-04 07:35:50,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:50,627 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-03-04 07:35:50,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:50,627 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-03-04 07:35:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:35:50,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:50,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:35:50,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:35:50,834 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 [2025-03-04 07:35:50,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:50,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 211890119, now seen corresponding path program 1 times [2025-03-04 07:35:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63338686] [2025-03-04 07:35:50,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:50,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:50,837 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) [2025-03-04 07:35:50,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:35:50,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:35:50,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:35:50,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:50,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:50,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:35:50,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:50,912 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 [2025-03-04 07:35:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:50,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:50,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:50,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63338686] [2025-03-04 07:35:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63338686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:50,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:50,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:35:50,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531060232] [2025-03-04 07:35:50,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:50,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:35:50,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:50,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:35:50,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:35:50,923 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:51,105 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-04 07:35:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:35:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:35:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:51,107 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:35:51,107 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:35:51,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:35:51,108 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:51,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 366 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:35:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:35:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2025-03-04 07:35:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:35:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2025-03-04 07:35:51,121 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2025-03-04 07:35:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:51,121 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2025-03-04 07:35:51,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2025-03-04 07:35:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:35:51,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:51,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:51,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:35:51,326 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 [2025-03-04 07:35:51,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1762940516, now seen corresponding path program 1 times [2025-03-04 07:35:51,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:51,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23765632] [2025-03-04 07:35:51,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:51,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:51,330 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) [2025-03-04 07:35:51,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:35:51,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:35:51,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:35:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:51,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:51,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:35:51,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:51,405 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 [2025-03-04 07:35:51,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:35:51,454 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 [2025-03-04 07:35:51,467 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:35:51,468 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 13 treesize of output 13 [2025-03-04 07:35:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:51,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:51,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23765632] [2025-03-04 07:35:51,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23765632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:51,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:35:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876890004] [2025-03-04 07:35:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:35:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:35:51,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:35:51,480 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:51,709 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2025-03-04 07:35:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:35:51,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:35:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:51,715 INFO L225 Difference]: With dead ends: 177 [2025-03-04 07:35:51,715 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 07:35:51,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:35:51,715 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 14 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:51,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 475 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:35:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 07:35:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2025-03-04 07:35:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:35:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2025-03-04 07:35:51,722 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2025-03-04 07:35:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:51,722 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2025-03-04 07:35:51,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2025-03-04 07:35:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:35:51,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:51,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:51,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:35:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:51,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2140473250, now seen corresponding path program 1 times [2025-03-04 07:35:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48251826] [2025-03-04 07:35:51,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:51,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:51,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:51,926 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) [2025-03-04 07:35:51,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:35:51,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:35:52,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:35:52,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:52,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:52,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:35:52,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:52,013 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 7 [2025-03-04 07:35:52,025 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 [2025-03-04 07:35:52,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:35:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:52,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:52,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48251826] [2025-03-04 07:35:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48251826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:52,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:52,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:35:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506396871] [2025-03-04 07:35:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:52,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:35:52,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:52,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:35:52,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:35:52,052 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:52,380 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2025-03-04 07:35:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:35:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:35:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:52,382 INFO L225 Difference]: With dead ends: 177 [2025-03-04 07:35:52,382 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 07:35:52,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:35:52,383 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 12 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:52,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 801 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:35:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 07:35:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2025-03-04 07:35:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:35:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2025-03-04 07:35:52,395 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2025-03-04 07:35:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:52,395 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2025-03-04 07:35:52,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2025-03-04 07:35:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:35:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:52,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:52,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:35:52,596 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 [2025-03-04 07:35:52,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:52,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1930161321, now seen corresponding path program 1 times [2025-03-04 07:35:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:52,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636123999] [2025-03-04 07:35:52,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:52,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:52,599 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) [2025-03-04 07:35:52,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:35:52,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:35:52,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:35:52,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:52,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:52,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:35:52,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:52,702 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 [2025-03-04 07:35:52,725 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 [2025-03-04 07:35:52,741 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 [2025-03-04 07:35:52,795 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 21 treesize of output 9 [2025-03-04 07:35:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:52,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:52,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636123999] [2025-03-04 07:35:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636123999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:52,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:52,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:35:52,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147398040] [2025-03-04 07:35:52,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:52,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:35:52,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:52,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:35:52,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:35:52,838 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:53,134 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2025-03-04 07:35:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:35:53,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:35:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:53,135 INFO L225 Difference]: With dead ends: 190 [2025-03-04 07:35:53,135 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 07:35:53,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:35:53,136 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:53,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 758 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:35:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 07:35:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-04 07:35:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:35:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2025-03-04 07:35:53,147 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2025-03-04 07:35:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:53,147 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2025-03-04 07:35:53,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:35:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2025-03-04 07:35:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:35:53,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:53,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:53,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:53,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:53,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:53,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash -170589798, now seen corresponding path program 1 times [2025-03-04 07:35:53,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:53,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [836283399] [2025-03-04 07:35:53,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:53,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:53,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:53,358 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:53,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:35:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:35:53,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:35:53,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:53,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:53,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:35:53,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:53,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:53,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:53,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836283399] [2025-03-04 07:35:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836283399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:53,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:53,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:35:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010362489] [2025-03-04 07:35:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:53,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:35:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:53,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:35:53,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:35:53,478 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:53,763 INFO L93 Difference]: Finished difference Result 188 states and 224 transitions. [2025-03-04 07:35:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:35:53,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 07:35:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:53,767 INFO L225 Difference]: With dead ends: 188 [2025-03-04 07:35:53,767 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 07:35:53,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:35:53,768 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 10 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:53,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 758 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:35:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 07:35:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-04 07:35:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 146 states have internal predecessors, (154), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:35:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2025-03-04 07:35:53,773 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 21 [2025-03-04 07:35:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:53,774 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2025-03-04 07:35:53,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2025-03-04 07:35:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:35:53,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:53,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:53,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:35:53,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:53,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:53,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash -170589797, now seen corresponding path program 1 times [2025-03-04 07:35:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895971403] [2025-03-04 07:35:53,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:53,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:53,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:35:54,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:35:54,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:35:54,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:54,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:54,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:35:54,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:54,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:54,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:54,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895971403] [2025-03-04 07:35:54,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895971403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:54,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:54,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:35:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355953255] [2025-03-04 07:35:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:54,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:35:54,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:54,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:35:54,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:35:54,124 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:54,227 INFO L93 Difference]: Finished difference Result 202 states and 242 transitions. [2025-03-04 07:35:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:35:54,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 07:35:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:54,229 INFO L225 Difference]: With dead ends: 202 [2025-03-04 07:35:54,230 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 07:35:54,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:35:54,230 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:54,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 772 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:35:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 07:35:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-04 07:35:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 154 states have internal predecessors, (162), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:35:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 236 transitions. [2025-03-04 07:35:54,236 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 236 transitions. Word has length 21 [2025-03-04 07:35:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:54,236 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 236 transitions. [2025-03-04 07:35:54,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 236 transitions. [2025-03-04 07:35:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:35:54,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:54,237 INFO L218 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] [2025-03-04 07:35:54,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:35:54,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:54,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:54,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:54,438 INFO L85 PathProgramCache]: Analyzing trace with hash -819685610, now seen corresponding path program 1 times [2025-03-04 07:35:54,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:54,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802121093] [2025-03-04 07:35:54,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:54,440 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:54,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:35:54,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:35:54,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:35:54,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:54,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:54,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:35:54,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:54,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:54,735 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:54,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802121093] [2025-03-04 07:35:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802121093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:54,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:35:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 07:35:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609632730] [2025-03-04 07:35:54,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:54,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:35:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:54,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:35:54,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:35:54,736 INFO L87 Difference]: Start difference. First operand 196 states and 236 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:35:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:55,086 INFO L93 Difference]: Finished difference Result 239 states and 293 transitions. [2025-03-04 07:35:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:35:55,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 07:35:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:55,088 INFO L225 Difference]: With dead ends: 239 [2025-03-04 07:35:55,088 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 07:35:55,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:35:55,089 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 81 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:55,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1160 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:35:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 07:35:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 214. [2025-03-04 07:35:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:35:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2025-03-04 07:35:55,097 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 22 [2025-03-04 07:35:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:55,097 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2025-03-04 07:35:55,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:35:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2025-03-04 07:35:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:35:55,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:55,098 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:55,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:35:55,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:55,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1748236197, now seen corresponding path program 2 times [2025-03-04 07:35:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018441771] [2025-03-04 07:35:55,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:35:55,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:55,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:55,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:35:55,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 07:35:55,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-04 07:35:55,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:35:55,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:55,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:35:55,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:35:55,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:55,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:55,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018441771] [2025-03-04 07:35:55,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018441771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:55,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:35:55,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060592101] [2025-03-04 07:35:55,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:55,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:35:55,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:55,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:35:55,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:35:55,482 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:55,836 INFO L93 Difference]: Finished difference Result 212 states and 260 transitions. [2025-03-04 07:35:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:35:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:35:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:55,838 INFO L225 Difference]: With dead ends: 212 [2025-03-04 07:35:55,838 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 07:35:55,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:35:55,838 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 9 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:55,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 950 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:35:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 07:35:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-04 07:35:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 169 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:35:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 260 transitions. [2025-03-04 07:35:55,847 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 260 transitions. Word has length 25 [2025-03-04 07:35:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:55,848 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 260 transitions. [2025-03-04 07:35:55,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 260 transitions. [2025-03-04 07:35:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:35:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:55,848 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:55,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:35:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:56,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1639252863, now seen corresponding path program 1 times [2025-03-04 07:35:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651154393] [2025-03-04 07:35:56,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:56,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:56,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:56,052 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:56,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:35:56,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:35:56,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:35:56,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:56,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:56,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:35:56,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:56,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:35:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:35:56,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651154393] [2025-03-04 07:35:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651154393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:35:56,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:35:56,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-04 07:35:56,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879692260] [2025-03-04 07:35:56,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:35:56,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:35:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:56,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:35:56,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:35:56,552 INFO L87 Difference]: Start difference. First operand 212 states and 260 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:35:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:57,389 INFO L93 Difference]: Finished difference Result 258 states and 323 transitions. [2025-03-04 07:35:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:35:57,389 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 07:35:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:57,390 INFO L225 Difference]: With dead ends: 258 [2025-03-04 07:35:57,390 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 07:35:57,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:35:57,391 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 70 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:57,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1879 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:35:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 07:35:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2025-03-04 07:35:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 136 states have (on average 1.4558823529411764) internal successors, (198), 178 states have internal predecessors, (198), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:35:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 272 transitions. [2025-03-04 07:35:57,397 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 272 transitions. Word has length 26 [2025-03-04 07:35:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:57,397 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 272 transitions. [2025-03-04 07:35:57,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:35:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 272 transitions. [2025-03-04 07:35:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:35:57,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:57,398 INFO L218 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:57,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:35:57,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:57,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash -422300481, now seen corresponding path program 2 times [2025-03-04 07:35:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:57,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899855919] [2025-03-04 07:35:57,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:35:57,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:57,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:57,601 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:57,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:35:57,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 07:35:57,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 30 statements. [2025-03-04 07:35:57,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:35:57,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:57,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:35:57,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:57,701 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 [2025-03-04 07:35:57,773 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 15 [2025-03-04 07:35:57,785 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 15 [2025-03-04 07:35:57,847 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 19 treesize of output 11 [2025-03-04 07:35:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 07:35:57,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:57,858 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899855919] [2025-03-04 07:35:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899855919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:57,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:35:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084513207] [2025-03-04 07:35:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:57,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:35:57,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:57,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:35:57,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:35:57,859 INFO L87 Difference]: Start difference. First operand 221 states and 272 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:58,294 INFO L93 Difference]: Finished difference Result 225 states and 280 transitions. [2025-03-04 07:35:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:35:58,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 07:35:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:58,295 INFO L225 Difference]: With dead ends: 225 [2025-03-04 07:35:58,296 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 07:35:58,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:35:58,296 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 12 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:58,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1104 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:35:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 07:35:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2025-03-04 07:35:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 136 states have (on average 1.4485294117647058) internal successors, (197), 177 states have internal predecessors, (197), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:35:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions. [2025-03-04 07:35:58,302 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 30 [2025-03-04 07:35:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:58,302 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 271 transitions. [2025-03-04 07:35:58,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2025-03-04 07:35:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:35:58,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:58,303 INFO L218 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:35:58,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:35:58,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:58,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:58,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash -422300480, now seen corresponding path program 1 times [2025-03-04 07:35:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:58,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844543881] [2025-03-04 07:35:58,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:58,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:58,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:58,506 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:58,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:35:58,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:35:58,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:35:58,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:58,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:58,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:35:58,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:58,628 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 10 treesize of output 9 [2025-03-04 07:35:58,658 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 [2025-03-04 07:35:58,666 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 [2025-03-04 07:35:58,805 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 29 treesize of output 17 [2025-03-04 07:35:58,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:35:58,823 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 29 treesize of output 17 [2025-03-04 07:35:58,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:35:58,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:35:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 07:35:58,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:58,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:58,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844543881] [2025-03-04 07:35:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844543881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:58,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:35:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658484025] [2025-03-04 07:35:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:58,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:35:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:58,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:35:58,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:35:58,932 INFO L87 Difference]: Start difference. First operand 220 states and 271 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:35:59,499 INFO L93 Difference]: Finished difference Result 224 states and 279 transitions. [2025-03-04 07:35:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:35:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 07:35:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:35:59,501 INFO L225 Difference]: With dead ends: 224 [2025-03-04 07:35:59,501 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 07:35:59,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:35:59,501 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 16 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:35:59,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1232 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:35:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 07:35:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2025-03-04 07:35:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 176 states have internal predecessors, (196), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-04 07:35:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 270 transitions. [2025-03-04 07:35:59,507 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 270 transitions. Word has length 30 [2025-03-04 07:35:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:35:59,507 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 270 transitions. [2025-03-04 07:35:59,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:35:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 270 transitions. [2025-03-04 07:35:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:35:59,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:35:59,508 INFO L218 NwaCegarLoop]: trace histogram [8, 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] [2025-03-04 07:35:59,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:35:59,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:59,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:35:59,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:35:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1503288212, now seen corresponding path program 1 times [2025-03-04 07:35:59,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:35:59,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235018246] [2025-03-04 07:35:59,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:35:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:35:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:35:59,711 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:35:59,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:35:59,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:35:59,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:35:59,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:35:59,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:35:59,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:35:59,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:35:59,861 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 [2025-03-04 07:35:59,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 [2025-03-04 07:35:59,881 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 [2025-03-04 07:35:59,906 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 21 treesize of output 9 [2025-03-04 07:35:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 07:35:59,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:35:59,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:35:59,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235018246] [2025-03-04 07:35:59,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235018246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:35:59,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:35:59,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:35:59,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009354827] [2025-03-04 07:35:59,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:35:59,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:35:59,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:35:59,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:35:59,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:35:59,949 INFO L87 Difference]: Start difference. First operand 219 states and 270 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:00,226 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2025-03-04 07:36:00,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:36:00,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-03-04 07:36:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:00,228 INFO L225 Difference]: With dead ends: 231 [2025-03-04 07:36:00,228 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 07:36:00,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:36:00,228 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 31 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:00,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 759 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 07:36:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2025-03-04 07:36:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 132 states have (on average 1.393939393939394) internal successors, (184), 172 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:36:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 254 transitions. [2025-03-04 07:36:00,234 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 254 transitions. Word has length 42 [2025-03-04 07:36:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:00,235 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 254 transitions. [2025-03-04 07:36:00,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:36:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 254 transitions. [2025-03-04 07:36:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 07:36:00,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:00,235 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:00,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:36:00,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:00,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:36:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -617035876, now seen corresponding path program 1 times [2025-03-04 07:36:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:36:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628795061] [2025-03-04 07:36:00,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:00,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:00,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:00,439 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:36:00,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:36:00,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 07:36:00,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 07:36:00,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:00,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:00,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:36:00,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 07:36:00,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:36:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 07:36:00,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:36:00,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628795061] [2025-03-04 07:36:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628795061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:36:00,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:36:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-04 07:36:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017003783] [2025-03-04 07:36:00,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:36:00,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:36:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:36:00,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:36:00,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:36:00,769 INFO L87 Difference]: Start difference. First operand 215 states and 254 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:36:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:01,140 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2025-03-04 07:36:01,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:36:01,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-04 07:36:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:01,142 INFO L225 Difference]: With dead ends: 234 [2025-03-04 07:36:01,142 INFO L226 Difference]: Without dead ends: 228 [2025-03-04 07:36:01,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:36:01,143 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 75 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:01,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1473 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-04 07:36:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2025-03-04 07:36:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 176 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:36:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 258 transitions. [2025-03-04 07:36:01,151 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 258 transitions. Word has length 53 [2025-03-04 07:36:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:01,151 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 258 transitions. [2025-03-04 07:36:01,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:36:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2025-03-04 07:36:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:36:01,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:01,153 INFO L218 NwaCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:01,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:36:01,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:01,357 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:36:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2027590876, now seen corresponding path program 2 times [2025-03-04 07:36:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:36:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408944044] [2025-03-04 07:36:01,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:36:01,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:01,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:01,359 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:36:01,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:36:01,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-04 07:36:01,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 57 statements. [2025-03-04 07:36:01,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:36:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:01,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:36:01,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 07:36:01,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:36:01,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:36:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408944044] [2025-03-04 07:36:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408944044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:01,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:36:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581484475] [2025-03-04 07:36:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:01,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:36:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:36:01,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:36:01,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:01,558 INFO L87 Difference]: Start difference. First operand 219 states and 258 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:36:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:01,842 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2025-03-04 07:36:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:36:01,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-04 07:36:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:01,843 INFO L225 Difference]: With dead ends: 217 [2025-03-04 07:36:01,843 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 07:36:01,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:36:01,844 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:01,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 789 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:36:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 07:36:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-04 07:36:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 174 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:36:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2025-03-04 07:36:01,849 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 57 [2025-03-04 07:36:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:01,850 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2025-03-04 07:36:01,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:36:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2025-03-04 07:36:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:36:01,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:01,850 INFO L218 NwaCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:01,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:36:02,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:02,055 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:36:02,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:02,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2027590875, now seen corresponding path program 1 times [2025-03-04 07:36:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:36:02,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206426689] [2025-03-04 07:36:02,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:02,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:02,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:02,057 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:36:02,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:36:02,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:36:02,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:36:02,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:02,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:02,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:36:02,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 07:36:02,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:36:02,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:36:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206426689] [2025-03-04 07:36:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206426689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:02,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:36:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592216657] [2025-03-04 07:36:02,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:02,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:36:02,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:36:02,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:36:02,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:02,251 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:36:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:36:02,485 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2025-03-04 07:36:02,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:36:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-04 07:36:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:36:02,486 INFO L225 Difference]: With dead ends: 215 [2025-03-04 07:36:02,486 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 07:36:02,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:36:02,487 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 9 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:36:02,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 739 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:36:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 07:36:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-04 07:36:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 172 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 07:36:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 254 transitions. [2025-03-04 07:36:02,495 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 254 transitions. Word has length 57 [2025-03-04 07:36:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:36:02,495 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 254 transitions. [2025-03-04 07:36:02,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:36:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 254 transitions. [2025-03-04 07:36:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:36:02,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:36:02,497 INFO L218 NwaCegarLoop]: trace histogram [14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:36:02,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:36:02,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:02,697 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-04 07:36:02,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:36:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1569192174, now seen corresponding path program 1 times [2025-03-04 07:36:02,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:36:02,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [469719844] [2025-03-04 07:36:02,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:36:02,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:36:02,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:36:02,700 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:36:02,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:36:02,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:36:02,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:36:02,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:36:02,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:36:02,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:36:02,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:36:02,872 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 [2025-03-04 07:36:02,925 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 15 [2025-03-04 07:36:02,930 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 15 [2025-03-04 07:36:02,973 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 19 treesize of output 11 [2025-03-04 07:36:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 07:36:02,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:36:02,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:36:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469719844] [2025-03-04 07:36:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469719844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:36:02,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:36:02,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:36:02,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536367177] [2025-03-04 07:36:02,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:36:02,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:36:02,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:36:02,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:36:02,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:36:02,986 INFO L87 Difference]: Start difference. First operand 215 states and 254 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)