./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/memory-model/4SB.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/AutomizerReach.xml -i ../sv-benchmarks/c/memory-model/4SB.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:55:45,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:55:45,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:55:45,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:55:45,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:55:45,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:55:45,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:55:45,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:55:45,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:55:45,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:55:45,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:55:45,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:55:45,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:55:45,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:55:45,608 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:55:45,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:55:45,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:55:45,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:55:45,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:55:45,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:55:45,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:55:45,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:55:45,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:55:45,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:55:45,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:55:45,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:55:45,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:55:45,612 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 ! call(reach_error())) ) 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 -> 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 [2025-03-08 00:55:45,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:55:45,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:55:45,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:55:45,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:55:45,860 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:55:45,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-model/4SB.i [2025-03-08 00:55:46,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca33feda/61a8a8ad67ff4b47b0a23dc290500775/FLAG6b499ed3e [2025-03-08 00:55:47,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:55:47,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-model/4SB.i [2025-03-08 00:55:47,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca33feda/61a8a8ad67ff4b47b0a23dc290500775/FLAG6b499ed3e [2025-03-08 00:55:47,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca33feda/61a8a8ad67ff4b47b0a23dc290500775 [2025-03-08 00:55:47,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:55:47,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:55:47,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:55:47,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:55:47,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:55:47,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:47,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e04781d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47, skipping insertion in model container [2025-03-08 00:55:47,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:47,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:55:47,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-model/4SB.i[21105,21118] [2025-03-08 00:55:47,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:55:47,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:55:47,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-model/4SB.i[21105,21118] [2025-03-08 00:55:47,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:55:47,876 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:55:47,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47 WrapperNode [2025-03-08 00:55:47,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:55:47,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:55:47,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:55:47,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:55:47,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:47,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:47,951 INFO L138 Inliner]: procedures = 27, calls = 680, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1617 [2025-03-08 00:55:47,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:55:47,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:55:47,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:55:47,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:55:47,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:47,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:47,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,006 INFO L175 MemorySlicer]: Split 488 memory accesses to 16 slices as follows [152, 10, 13, 3, 10, 96, 60, 45, 11, 12, 12, 10, 15, 13, 13, 13]. 31 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [0, 0, 5, 0, 0, 0, 0, 0, 0, 5, 10, 1, 0, 5, 5, 5]. The 171 writes are split as follows [80, 5, 2, 2, 5, 20, 20, 15, 5, 2, 1, 3, 5, 2, 2, 2]. [2025-03-08 00:55:48,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:55:48,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:55:48,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:55:48,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:55:48,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (1/1) ... [2025-03-08 00:55:48,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:55:48,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:48,098 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-08 00:55:48,100 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-08 00:55:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure store_buffering_4_conditions [2025-03-08 00:55:48,115 INFO L138 BoogieDeclarations]: Found implementation of procedure store_buffering_4_conditions [2025-03-08 00:55:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_write [2025-03-08 00:55:48,115 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_write [2025-03-08 00:55:48,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_headerT [2025-03-08 00:55:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_nondet_headerT [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure stepWriteBuffer [2025-03-08 00:55:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure stepWriteBuffer [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_read [2025-03-08 00:55:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_read [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 00:55:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 00:55:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure initWriteBuffer [2025-03-08 00:55:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure initWriteBuffer [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_fence [2025-03-08 00:55:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_fence [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:55:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:55:48,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:55:48,310 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:55:48,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:55:49,244 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L62: havoc __VERIFIER_nondet_operations_#t~nondet1#1; [2025-03-08 00:55:49,244 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~mem10#1;havoc #t~mem11#1;call ULTIMATE.dealloc(~#result~0#1.base, ~#result~0#1.offset);havoc ~#result~0#1.base, ~#result~0#1.offset; [2025-03-08 00:55:49,815 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc __VERIFIER_nondet_step_#t~nondet0#1; [2025-03-08 00:55:49,815 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: call ULTIMATE.dealloc(main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset);havoc main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset);havoc main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset);havoc main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset);havoc main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset);havoc main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset;call ULTIMATE.dealloc(main_~#g_history~0#1.base, main_~#g_history~0#1.offset);havoc main_~#g_history~0#1.base, main_~#g_history~0#1.offset;call ULTIMATE.dealloc(main_~#global_time~0#1.base, main_~#global_time~0#1.offset);havoc main_~#global_time~0#1.base, main_~#global_time~0#1.offset;call ULTIMATE.dealloc(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset);havoc main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset;call ULTIMATE.dealloc(main_~#input_action~0#1.base, main_~#input_action~0#1.offset);havoc main_~#input_action~0#1.base, main_~#input_action~0#1.offset; [2025-03-08 00:55:49,871 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2025-03-08 00:55:49,871 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:55:49,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:55:49,888 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:55:49,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:55:49 BoogieIcfgContainer [2025-03-08 00:55:49,888 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:55:49,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:55:49,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:55:49,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:55:49,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:55:47" (1/3) ... [2025-03-08 00:55:49,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab4ffdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:55:49, skipping insertion in model container [2025-03-08 00:55:49,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:47" (2/3) ... [2025-03-08 00:55:49,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab4ffdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:55:49, skipping insertion in model container [2025-03-08 00:55:49,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:55:49" (3/3) ... [2025-03-08 00:55:49,895 INFO L128 eAbstractionObserver]: Analyzing ICFG 4SB.i [2025-03-08 00:55:49,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:55:49,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 4SB.i that has 8 procedures, 272 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-08 00:55:49,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:55:49,957 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=LoopHeads, 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;@7f2cd9c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:55:49,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:55:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 242 states have internal predecessors, (372), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:55:49,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:49,971 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:49,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1745163428, now seen corresponding path program 1 times [2025-03-08 00:55:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851626070] [2025-03-08 00:55:49,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:50,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 00:55:50,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:55:50,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:50,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 00:55:50,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851626070] [2025-03-08 00:55:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851626070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:55:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643468888] [2025-03-08 00:55:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:50,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:50,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:50,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:55:50,786 INFO L87 Difference]: Start difference. First operand has 272 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 242 states have internal predecessors, (372), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) 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, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:50,849 INFO L93 Difference]: Finished difference Result 542 states and 846 transitions. [2025-03-08 00:55:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:50,851 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, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2025-03-08 00:55:50,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:50,859 INFO L225 Difference]: With dead ends: 542 [2025-03-08 00:55:50,859 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 00:55:50,864 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-08 00:55:50,866 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 747 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-08 00:55:50,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 747 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 00:55:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-03-08 00:55:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 224 states have (on average 1.3258928571428572) internal successors, (297), 228 states have internal predecessors, (297), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 349 transitions. [2025-03-08 00:55:50,916 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 349 transitions. Word has length 64 [2025-03-08 00:55:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:50,917 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 349 transitions. [2025-03-08 00:55:50,918 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, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 349 transitions. [2025-03-08 00:55:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 00:55:50,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:50,922 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:50,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:55:50,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:50,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:50,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2006953936, now seen corresponding path program 1 times [2025-03-08 00:55:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:50,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063395541] [2025-03-08 00:55:50,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:51,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:55:51,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:55:51,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:51,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 00:55:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063395541] [2025-03-08 00:55:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063395541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412363300] [2025-03-08 00:55:51,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:51,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:51,260 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-08 00:55:51,261 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-08 00:55:51,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:55:51,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:55:51,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:51,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:51,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:51,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:55:51,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412363300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136927315] [2025-03-08 00:55:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:51,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:51,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:51,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:51,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:51,714 INFO L87 Difference]: Start difference. First operand 258 states and 349 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:51,739 INFO L93 Difference]: Finished difference Result 511 states and 696 transitions. [2025-03-08 00:55:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2025-03-08 00:55:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:51,742 INFO L225 Difference]: With dead ends: 511 [2025-03-08 00:55:51,744 INFO L226 Difference]: Without dead ends: 259 [2025-03-08 00:55:51,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:51,745 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:51,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 692 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-08 00:55:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-08 00:55:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 225 states have (on average 1.3244444444444445) internal successors, (298), 229 states have internal predecessors, (298), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 350 transitions. [2025-03-08 00:55:51,763 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 350 transitions. Word has length 66 [2025-03-08 00:55:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 350 transitions. [2025-03-08 00:55:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:51,764 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 350 transitions. [2025-03-08 00:55:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 00:55:51,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:51,767 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:51,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:51,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:51,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:51,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1263199732, now seen corresponding path program 1 times [2025-03-08 00:55:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:51,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911717961] [2025-03-08 00:55:51,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:52,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 00:55:52,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 00:55:52,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:52,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 00:55:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911717961] [2025-03-08 00:55:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911717961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619471534] [2025-03-08 00:55:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:52,230 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-08 00:55:52,231 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-08 00:55:52,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 00:55:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 00:55:52,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:52,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:52,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:52,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 00:55:52,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619471534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:52,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:52,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505071820] [2025-03-08 00:55:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:52,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:52,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:52,627 INFO L87 Difference]: Start difference. First operand 259 states and 350 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:52,658 INFO L93 Difference]: Finished difference Result 501 states and 677 transitions. [2025-03-08 00:55:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:52,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2025-03-08 00:55:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:52,662 INFO L225 Difference]: With dead ends: 501 [2025-03-08 00:55:52,662 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 00:55:52,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:52,663 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:52,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 683 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 00:55:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2025-03-08 00:55:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 226 states have (on average 1.323008849557522) internal successors, (299), 230 states have internal predecessors, (299), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 351 transitions. [2025-03-08 00:55:52,675 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 351 transitions. Word has length 70 [2025-03-08 00:55:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 351 transitions. [2025-03-08 00:55:52,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 351 transitions. [2025-03-08 00:55:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 00:55:52,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:52,677 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:52,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:52,877 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,SelfDestructingSolverStorable2 [2025-03-08 00:55:52,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:52,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1625438621, now seen corresponding path program 1 times [2025-03-08 00:55:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:52,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513844966] [2025-03-08 00:55:52,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:52,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 00:55:52,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 00:55:52,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:52,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:55:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513844966] [2025-03-08 00:55:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513844966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79671957] [2025-03-08 00:55:53,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:53,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:53,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:53,106 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-08 00:55:53,108 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-08 00:55:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 00:55:53,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 00:55:53,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:53,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:53,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:53,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 00:55:53,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79671957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:53,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:53,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:53,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961060739] [2025-03-08 00:55:53,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:53,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:53,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:53,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:53,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:53,518 INFO L87 Difference]: Start difference. First operand 260 states and 351 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:53,545 INFO L93 Difference]: Finished difference Result 495 states and 668 transitions. [2025-03-08 00:55:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-03-08 00:55:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:53,548 INFO L225 Difference]: With dead ends: 495 [2025-03-08 00:55:53,548 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 00:55:53,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:53,549 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:53,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 00:55:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2025-03-08 00:55:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 227 states have (on average 1.3215859030837005) internal successors, (300), 231 states have internal predecessors, (300), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 352 transitions. [2025-03-08 00:55:53,558 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 352 transitions. Word has length 73 [2025-03-08 00:55:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:53,558 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 352 transitions. [2025-03-08 00:55:53,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 352 transitions. [2025-03-08 00:55:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 00:55:53,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:53,560 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:53,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:53,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:53,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:53,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1597748122, now seen corresponding path program 1 times [2025-03-08 00:55:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628672175] [2025-03-08 00:55:53,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:53,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 00:55:53,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 00:55:53,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:53,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 00:55:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628672175] [2025-03-08 00:55:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628672175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470902944] [2025-03-08 00:55:53,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:53,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:53,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:53,989 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-08 00:55:53,991 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-08 00:55:54,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 00:55:54,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 00:55:54,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:54,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:54,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:54,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 00:55:54,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:54,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470902944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710445939] [2025-03-08 00:55:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:54,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:54,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:54,350 INFO L87 Difference]: Start difference. First operand 261 states and 352 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:54,372 INFO L93 Difference]: Finished difference Result 489 states and 659 transitions. [2025-03-08 00:55:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-03-08 00:55:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:54,374 INFO L225 Difference]: With dead ends: 489 [2025-03-08 00:55:54,374 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 00:55:54,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:54,375 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:54,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 00:55:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2025-03-08 00:55:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2025-03-08 00:55:54,382 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 76 [2025-03-08 00:55:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:54,382 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2025-03-08 00:55:54,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2025-03-08 00:55:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 00:55:54,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:54,384 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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-08 00:55:54,391 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-08 00:55:54,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:54,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1536898621, now seen corresponding path program 1 times [2025-03-08 00:55:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819065625] [2025-03-08 00:55:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 00:55:54,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 00:55:54,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:54,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 00:55:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819065625] [2025-03-08 00:55:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819065625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742503783] [2025-03-08 00:55:54,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:54,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:54,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:54,812 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-08 00:55:54,813 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-08 00:55:55,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 00:55:55,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 00:55:55,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:55,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:55,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:55,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:55:55,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:55,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742503783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:55,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:55,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:55,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154040028] [2025-03-08 00:55:55,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:55,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:55,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:55,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:55,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:55,154 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:55,194 INFO L93 Difference]: Finished difference Result 479 states and 647 transitions. [2025-03-08 00:55:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 79 [2025-03-08 00:55:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:55,197 INFO L225 Difference]: With dead ends: 479 [2025-03-08 00:55:55,198 INFO L226 Difference]: Without dead ends: 269 [2025-03-08 00:55:55,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:55,199 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:55,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-08 00:55:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2025-03-08 00:55:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 229 states have (on average 1.3187772925764192) internal successors, (302), 233 states have internal predecessors, (302), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 354 transitions. [2025-03-08 00:55:55,210 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 354 transitions. Word has length 79 [2025-03-08 00:55:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:55,210 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 354 transitions. [2025-03-08 00:55:55,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 354 transitions. [2025-03-08 00:55:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 00:55:55,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:55,213 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 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-08 00:55:55,220 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-08 00:55:55,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:55,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:55,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash -571158080, now seen corresponding path program 1 times [2025-03-08 00:55:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:55,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520038416] [2025-03-08 00:55:55,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:55,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 00:55:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 00:55:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:55,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 00:55:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520038416] [2025-03-08 00:55:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520038416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238839637] [2025-03-08 00:55:55,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:55,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:55,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:55,632 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-08 00:55:55,634 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-08 00:55:55,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 00:55:55,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 00:55:55,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:55,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:55,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:55,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:55,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:55,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238839637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:55,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:55,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428594280] [2025-03-08 00:55:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:55,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:55,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:55,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:55,961 INFO L87 Difference]: Start difference. First operand 263 states and 354 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:56,051 INFO L93 Difference]: Finished difference Result 330 states and 460 transitions. [2025-03-08 00:55:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:56,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 82 [2025-03-08 00:55:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:56,053 INFO L225 Difference]: With dead ends: 330 [2025-03-08 00:55:56,053 INFO L226 Difference]: Without dead ends: 321 [2025-03-08 00:55:56,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:56,054 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 93 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:56,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 604 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-08 00:55:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 264. [2025-03-08 00:55:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 230 states have (on average 1.317391304347826) internal successors, (303), 234 states have internal predecessors, (303), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 355 transitions. [2025-03-08 00:55:56,066 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 355 transitions. Word has length 82 [2025-03-08 00:55:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:56,067 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 355 transitions. [2025-03-08 00:55:56,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2025-03-08 00:55:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 00:55:56,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:56,069 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:55:56,076 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-08 00:55:56,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:56,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:56,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2009509676, now seen corresponding path program 1 times [2025-03-08 00:55:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225591699] [2025-03-08 00:55:56,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:56,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:56,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 00:55:56,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 00:55:56,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:56,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225591699] [2025-03-08 00:55:56,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225591699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:56,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177807413] [2025-03-08 00:55:56,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:56,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:56,477 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-08 00:55:56,478 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-08 00:55:56,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 00:55:56,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 00:55:56,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:56,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:56,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:56,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177807413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:56,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:56,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:55:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562935742] [2025-03-08 00:55:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:56,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:56,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:56,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:56,852 INFO L87 Difference]: Start difference. First operand 264 states and 355 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:56,871 INFO L93 Difference]: Finished difference Result 334 states and 465 transitions. [2025-03-08 00:55:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-03-08 00:55:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:56,872 INFO L225 Difference]: With dead ends: 334 [2025-03-08 00:55:56,872 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 00:55:56,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:56,873 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:56,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 00:55:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2025-03-08 00:55:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 232 states have (on average 1.3146551724137931) internal successors, (305), 236 states have internal predecessors, (305), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 357 transitions. [2025-03-08 00:55:56,882 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 357 transitions. Word has length 92 [2025-03-08 00:55:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:56,883 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 357 transitions. [2025-03-08 00:55:56,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 357 transitions. [2025-03-08 00:55:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 00:55:56,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:56,886 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:55:56,893 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-08 00:55:57,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:57,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:57,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1503951051, now seen corresponding path program 1 times [2025-03-08 00:55:57,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:57,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953909775] [2025-03-08 00:55:57,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:57,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:57,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 00:55:57,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 00:55:57,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:57,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953909775] [2025-03-08 00:55:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953909775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287815113] [2025-03-08 00:55:57,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:57,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:57,286 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-08 00:55:57,288 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-08 00:55:57,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 00:55:57,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 00:55:57,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:57,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:57,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:57,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:57,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287815113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:55:57,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194829040] [2025-03-08 00:55:57,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:57,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:57,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:57,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:57,703 INFO L87 Difference]: Start difference. First operand 266 states and 357 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:57,732 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2025-03-08 00:55:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:57,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-03-08 00:55:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:57,734 INFO L225 Difference]: With dead ends: 338 [2025-03-08 00:55:57,735 INFO L226 Difference]: Without dead ends: 269 [2025-03-08 00:55:57,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:57,737 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:57,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-08 00:55:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-08 00:55:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 239 states have internal predecessors, (308), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2025-03-08 00:55:57,743 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 92 [2025-03-08 00:55:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:57,743 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2025-03-08 00:55:57,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2025-03-08 00:55:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 00:55:57,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:57,744 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:55:57,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:57,945 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,SelfDestructingSolverStorable8 [2025-03-08 00:55:57,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:57,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1774923443, now seen corresponding path program 1 times [2025-03-08 00:55:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153693418] [2025-03-08 00:55:57,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:58,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 00:55:58,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 00:55:58,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:58,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153693418] [2025-03-08 00:55:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153693418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406911383] [2025-03-08 00:55:58,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:58,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:58,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:58,168 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-08 00:55:58,173 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-08 00:55:58,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 00:55:58,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 00:55:58,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:58,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:58,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:58,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:55:58,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406911383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:58,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:58,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168851090] [2025-03-08 00:55:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:58,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:58,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:58,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:58,587 INFO L87 Difference]: Start difference. First operand 269 states and 360 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:58,597 INFO L93 Difference]: Finished difference Result 341 states and 471 transitions. [2025-03-08 00:55:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-03-08 00:55:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:58,599 INFO L225 Difference]: With dead ends: 341 [2025-03-08 00:55:58,599 INFO L226 Difference]: Without dead ends: 332 [2025-03-08 00:55:58,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:58,600 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 83 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:58,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-08 00:55:58,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2025-03-08 00:55:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 297 states have (on average 1.367003367003367) internal successors, (406), 301 states have internal predecessors, (406), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2025-03-08 00:55:58,607 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 92 [2025-03-08 00:55:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:58,607 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2025-03-08 00:55:58,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2025-03-08 00:55:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 00:55:58,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:58,608 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:55:58,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:55:58,808 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,SelfDestructingSolverStorable9 [2025-03-08 00:55:58,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:58,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash -355107272, now seen corresponding path program 1 times [2025-03-08 00:55:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:58,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848318213] [2025-03-08 00:55:58,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:58,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:55:58,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:55:58,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:58,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:58,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848318213] [2025-03-08 00:55:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848318213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727268931] [2025-03-08 00:55:58,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:58,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:58,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:58,995 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-08 00:55:58,996 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-08 00:55:59,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:55:59,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:55:59,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:59,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:59,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:59,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:59,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727268931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:59,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:59,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275135614] [2025-03-08 00:55:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:59,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:59,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:59,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:59,494 INFO L87 Difference]: Start difference. First operand 331 states and 458 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:59,506 INFO L93 Difference]: Finished difference Result 405 states and 573 transitions. [2025-03-08 00:55:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:59,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-08 00:55:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:59,508 INFO L225 Difference]: With dead ends: 405 [2025-03-08 00:55:59,508 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 00:55:59,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:59,509 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:59,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 00:55:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-08 00:55:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 299 states have (on average 1.3645484949832776) internal successors, (408), 303 states have internal predecessors, (408), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:55:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 460 transitions. [2025-03-08 00:55:59,520 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 460 transitions. Word has length 120 [2025-03-08 00:55:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 460 transitions. [2025-03-08 00:55:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 460 transitions. [2025-03-08 00:55:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 00:55:59,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:59,522 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:55:59,530 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-08 00:55:59,722 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,SelfDestructingSolverStorable10 [2025-03-08 00:55:59,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash -484189991, now seen corresponding path program 1 times [2025-03-08 00:55:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:59,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668209488] [2025-03-08 00:55:59,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:59,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:59,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:55:59,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:55:59,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:59,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668209488] [2025-03-08 00:55:59,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668209488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:59,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896960374] [2025-03-08 00:55:59,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:59,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:59,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:59,904 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-08 00:55:59,905 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-08 00:56:00,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:56:00,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:56:00,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:00,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:00,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:00,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:56:00,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896960374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:00,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:56:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837964412] [2025-03-08 00:56:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:56:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:00,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:56:00,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:56:00,340 INFO L87 Difference]: Start difference. First operand 333 states and 460 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:00,360 INFO L93 Difference]: Finished difference Result 476 states and 682 transitions. [2025-03-08 00:56:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:56:00,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-08 00:56:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:00,361 INFO L225 Difference]: With dead ends: 476 [2025-03-08 00:56:00,361 INFO L226 Difference]: Without dead ends: 339 [2025-03-08 00:56:00,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:56:00,362 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:00,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-08 00:56:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-03-08 00:56:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 305 states have (on average 1.3573770491803279) internal successors, (414), 309 states have internal predecessors, (414), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-03-08 00:56:00,369 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 120 [2025-03-08 00:56:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-03-08 00:56:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-03-08 00:56:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 00:56:00,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:00,371 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:00,379 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-08 00:56:00,571 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,SelfDestructingSolverStorable11 [2025-03-08 00:56:00,571 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:00,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:00,572 INFO L85 PathProgramCache]: Analyzing trace with hash 541302008, now seen corresponding path program 1 times [2025-03-08 00:56:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:00,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798716450] [2025-03-08 00:56:00,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:00,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:56:00,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:56:00,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:00,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:56:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798716450] [2025-03-08 00:56:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798716450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588887598] [2025-03-08 00:56:00,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:00,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:00,751 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-08 00:56:00,752 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-08 00:56:01,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:56:01,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:56:01,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:01,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:01,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:01,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:56:01,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588887598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:56:01,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976060754] [2025-03-08 00:56:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:01,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:56:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:01,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:56:01,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:56:01,174 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:01,191 INFO L93 Difference]: Finished difference Result 488 states and 694 transitions. [2025-03-08 00:56:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:56:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-08 00:56:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:01,193 INFO L225 Difference]: With dead ends: 488 [2025-03-08 00:56:01,193 INFO L226 Difference]: Without dead ends: 345 [2025-03-08 00:56:01,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:56:01,194 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:01,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-08 00:56:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-08 00:56:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 311 states have (on average 1.3504823151125402) internal successors, (420), 315 states have internal predecessors, (420), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2025-03-08 00:56:01,205 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 120 [2025-03-08 00:56:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:01,206 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2025-03-08 00:56:01,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2025-03-08 00:56:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 00:56:01,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:01,207 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:01,215 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-08 00:56:01,407 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,SelfDestructingSolverStorable12 [2025-03-08 00:56:01,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:01,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash 572321815, now seen corresponding path program 1 times [2025-03-08 00:56:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322846835] [2025-03-08 00:56:01,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:01,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:56:01,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:56:01,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:01,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:56:01,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322846835] [2025-03-08 00:56:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322846835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421812370] [2025-03-08 00:56:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:01,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:01,592 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-08 00:56:01,594 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-08 00:56:01,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 00:56:01,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 00:56:01,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:01,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:01,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:01,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:56:02,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421812370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:02,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:02,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41887998] [2025-03-08 00:56:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:02,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:02,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:02,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:02,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:02,038 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:02,049 INFO L93 Difference]: Finished difference Result 494 states and 696 transitions. [2025-03-08 00:56:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:02,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-08 00:56:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:02,051 INFO L225 Difference]: With dead ends: 494 [2025-03-08 00:56:02,051 INFO L226 Difference]: Without dead ends: 485 [2025-03-08 00:56:02,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:02,052 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 55 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:02,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 691 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-08 00:56:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-03-08 00:56:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 451 states have (on average 1.401330376940133) internal successors, (632), 455 states have internal predecessors, (632), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2025-03-08 00:56:02,061 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 120 [2025-03-08 00:56:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:02,061 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2025-03-08 00:56:02,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2025-03-08 00:56:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 00:56:02,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:02,074 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:02,082 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-08 00:56:02,275 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,SelfDestructingSolverStorable13 [2025-03-08 00:56:02,275 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:02,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash 789065444, now seen corresponding path program 1 times [2025-03-08 00:56:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889602834] [2025-03-08 00:56:02,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:02,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 00:56:02,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 00:56:02,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:02,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 00:56:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889602834] [2025-03-08 00:56:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889602834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608389431] [2025-03-08 00:56:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:02,452 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-08 00:56:02,453 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-08 00:56:02,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 00:56:02,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 00:56:02,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:02,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:02,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:02,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 00:56:02,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608389431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900357862] [2025-03-08 00:56:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:02,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:02,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:02,950 INFO L87 Difference]: Start difference. First operand 485 states and 684 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:02,962 INFO L93 Difference]: Finished difference Result 774 states and 1120 transitions. [2025-03-08 00:56:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:02,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 130 [2025-03-08 00:56:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:02,965 INFO L225 Difference]: With dead ends: 774 [2025-03-08 00:56:02,965 INFO L226 Difference]: Without dead ends: 765 [2025-03-08 00:56:02,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:02,965 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 51 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:02,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-08 00:56:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2025-03-08 00:56:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 731 states have (on average 1.4445964432284542) internal successors, (1056), 735 states have internal predecessors, (1056), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1108 transitions. [2025-03-08 00:56:02,978 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1108 transitions. Word has length 130 [2025-03-08 00:56:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:02,978 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1108 transitions. [2025-03-08 00:56:02,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1108 transitions. [2025-03-08 00:56:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 00:56:02,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:02,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:02,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:03,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:03,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:03,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash -388951835, now seen corresponding path program 1 times [2025-03-08 00:56:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:03,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144348966] [2025-03-08 00:56:03,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:03,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:03,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 00:56:03,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 00:56:03,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:03,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 00:56:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:03,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144348966] [2025-03-08 00:56:03,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144348966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:03,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564818257] [2025-03-08 00:56:03,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:03,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:03,352 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-08 00:56:03,354 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-08 00:56:03,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 00:56:03,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 00:56:03,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:03,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:03,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 00:56:03,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:03,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564818257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:03,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:03,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528168914] [2025-03-08 00:56:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:03,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:03,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:03,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:03,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:03,950 INFO L87 Difference]: Start difference. First operand 765 states and 1108 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:03,964 INFO L93 Difference]: Finished difference Result 1334 states and 1968 transitions. [2025-03-08 00:56:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:03,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-03-08 00:56:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:03,968 INFO L225 Difference]: With dead ends: 1334 [2025-03-08 00:56:03,968 INFO L226 Difference]: Without dead ends: 1325 [2025-03-08 00:56:03,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:03,969 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 48 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:03,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-08 00:56:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2025-03-08 00:56:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1291 states have (on average 1.474825716498838) internal successors, (1904), 1295 states have internal predecessors, (1904), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1956 transitions. [2025-03-08 00:56:03,988 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1956 transitions. Word has length 154 [2025-03-08 00:56:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:03,989 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1956 transitions. [2025-03-08 00:56:03,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1956 transitions. [2025-03-08 00:56:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 00:56:03,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:03,991 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:04,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:04,191 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,SelfDestructingSolverStorable15 [2025-03-08 00:56:04,192 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:04,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash 290103724, now seen corresponding path program 1 times [2025-03-08 00:56:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:04,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732640071] [2025-03-08 00:56:04,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:04,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:56:04,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:56:04,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:04,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-08 00:56:04,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:04,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732640071] [2025-03-08 00:56:04,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732640071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:04,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148093481] [2025-03-08 00:56:04,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:04,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:04,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:04,381 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-08 00:56:04,400 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-08 00:56:04,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:56:04,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:56:04,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:04,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:04,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:04,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 00:56:04,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:04,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148093481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:04,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:04,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:04,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899158033] [2025-03-08 00:56:04,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:04,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:04,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:04,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:04,951 INFO L87 Difference]: Start difference. First operand 1325 states and 1956 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:04,971 INFO L93 Difference]: Finished difference Result 2454 states and 3664 transitions. [2025-03-08 00:56:04,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:04,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 170 [2025-03-08 00:56:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:04,980 INFO L225 Difference]: With dead ends: 2454 [2025-03-08 00:56:04,980 INFO L226 Difference]: Without dead ends: 2445 [2025-03-08 00:56:04,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:04,981 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 45 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:04,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-03-08 00:56:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2445. [2025-03-08 00:56:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2411 states have (on average 1.4931563666528411) internal successors, (3600), 2415 states have internal predecessors, (3600), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3652 transitions. [2025-03-08 00:56:05,023 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3652 transitions. Word has length 170 [2025-03-08 00:56:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:05,024 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3652 transitions. [2025-03-08 00:56:05,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3652 transitions. [2025-03-08 00:56:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 00:56:05,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:05,028 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:05,037 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-08 00:56:05,228 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,SelfDestructingSolverStorable16 [2025-03-08 00:56:05,229 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:05,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1186272199, now seen corresponding path program 1 times [2025-03-08 00:56:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:05,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123492397] [2025-03-08 00:56:05,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:05,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 00:56:05,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 00:56:05,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:05,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-08 00:56:05,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123492397] [2025-03-08 00:56:05,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123492397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:05,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8072931] [2025-03-08 00:56:05,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:05,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:05,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:05,435 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-08 00:56:05,438 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-08 00:56:05,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 00:56:05,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 00:56:05,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:05,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:05,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:56:05,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-08 00:56:05,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:05,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8072931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:05,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:05,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221598199] [2025-03-08 00:56:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:05,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:05,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:05,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:05,938 INFO L87 Difference]: Start difference. First operand 2445 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:05,960 INFO L93 Difference]: Finished difference Result 3606 states and 5424 transitions. [2025-03-08 00:56:05,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 200 [2025-03-08 00:56:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:05,967 INFO L225 Difference]: With dead ends: 3606 [2025-03-08 00:56:05,967 INFO L226 Difference]: Without dead ends: 2477 [2025-03-08 00:56:05,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:05,969 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:05,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-08 00:56:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2025-03-08 00:56:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2443 states have (on average 1.4866966844044207) internal successors, (3632), 2447 states have internal predecessors, (3632), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3684 transitions. [2025-03-08 00:56:06,002 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3684 transitions. Word has length 200 [2025-03-08 00:56:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:06,002 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3684 transitions. [2025-03-08 00:56:06,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3684 transitions. [2025-03-08 00:56:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-08 00:56:06,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:06,006 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:06,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:06,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:56:06,207 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:06,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1558568488, now seen corresponding path program 1 times [2025-03-08 00:56:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673620817] [2025-03-08 00:56:06,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:06,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 00:56:06,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 00:56:06,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:06,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-08 00:56:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673620817] [2025-03-08 00:56:06,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673620817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259631442] [2025-03-08 00:56:06,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:06,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:06,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:06,408 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:06,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:56:06,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 00:56:06,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 00:56:06,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:06,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:06,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-08 00:56:06,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:06,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259631442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:06,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:06,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476614613] [2025-03-08 00:56:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:06,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:06,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:06,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:06,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:06,999 INFO L87 Difference]: Start difference. First operand 2477 states and 3684 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:07,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:07,023 INFO L93 Difference]: Finished difference Result 4758 states and 7120 transitions. [2025-03-08 00:56:07,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:07,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 200 [2025-03-08 00:56:07,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:07,036 INFO L225 Difference]: With dead ends: 4758 [2025-03-08 00:56:07,036 INFO L226 Difference]: Without dead ends: 4749 [2025-03-08 00:56:07,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:07,038 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 43 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:07,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2025-03-08 00:56:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 4749. [2025-03-08 00:56:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 4715 states have (on average 1.4965005302226935) internal successors, (7056), 4719 states have internal predecessors, (7056), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 7108 transitions. [2025-03-08 00:56:07,102 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 7108 transitions. Word has length 200 [2025-03-08 00:56:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 4749 states and 7108 transitions. [2025-03-08 00:56:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 7108 transitions. [2025-03-08 00:56:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-08 00:56:07,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:07,110 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:07,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:07,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:07,311 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:07,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash -546773065, now seen corresponding path program 1 times [2025-03-08 00:56:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382360632] [2025-03-08 00:56:07,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:07,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 00:56:07,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 00:56:07,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:07,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-08 00:56:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382360632] [2025-03-08 00:56:07,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382360632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096888218] [2025-03-08 00:56:07,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:07,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:07,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:07,614 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:07,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:56:08,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 00:56:08,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 00:56:08,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:08,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:08,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:08,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-08 00:56:08,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096888218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069640127] [2025-03-08 00:56:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:08,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:08,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:08,266 INFO L87 Difference]: Start difference. First operand 4749 states and 7108 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:08,293 INFO L93 Difference]: Finished difference Result 9302 states and 13968 transitions. [2025-03-08 00:56:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 252 [2025-03-08 00:56:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:08,316 INFO L225 Difference]: With dead ends: 9302 [2025-03-08 00:56:08,316 INFO L226 Difference]: Without dead ends: 9293 [2025-03-08 00:56:08,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:08,322 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 27 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:08,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9293 states. [2025-03-08 00:56:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 9293. [2025-03-08 00:56:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9293 states, 9259 states have (on average 1.5016740468733125) internal successors, (13904), 9263 states have internal predecessors, (13904), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9293 states to 9293 states and 13956 transitions. [2025-03-08 00:56:08,458 INFO L78 Accepts]: Start accepts. Automaton has 9293 states and 13956 transitions. Word has length 252 [2025-03-08 00:56:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:08,458 INFO L471 AbstractCegarLoop]: Abstraction has 9293 states and 13956 transitions. [2025-03-08 00:56:08,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9293 states and 13956 transitions. [2025-03-08 00:56:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-08 00:56:08,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:08,471 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:08,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 00:56:08,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:08,671 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1280385270, now seen corresponding path program 1 times [2025-03-08 00:56:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827885468] [2025-03-08 00:56:08,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:08,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-08 00:56:08,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-08 00:56:08,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:08,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2025-03-08 00:56:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827885468] [2025-03-08 00:56:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827885468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631376759] [2025-03-08 00:56:08,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:08,893 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:08,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:56:09,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-08 00:56:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-08 00:56:09,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:09,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:09,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:09,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-08 00:56:09,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631376759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:09,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:56:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588297146] [2025-03-08 00:56:09,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:56:09,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:56:09,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:09,644 INFO L87 Difference]: Start difference. First operand 9293 states and 13956 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:09,697 INFO L93 Difference]: Finished difference Result 18390 states and 27664 transitions. [2025-03-08 00:56:09,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:56:09,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 296 [2025-03-08 00:56:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:09,728 INFO L225 Difference]: With dead ends: 18390 [2025-03-08 00:56:09,728 INFO L226 Difference]: Without dead ends: 18381 [2025-03-08 00:56:09,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:56:09,735 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 26 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:09,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18381 states. [2025-03-08 00:56:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18381 to 18381. [2025-03-08 00:56:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18381 states, 18347 states have (on average 1.5043331334823131) internal successors, (27600), 18351 states have internal predecessors, (27600), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18381 states to 18381 states and 27652 transitions. [2025-03-08 00:56:09,952 INFO L78 Accepts]: Start accepts. Automaton has 18381 states and 27652 transitions. Word has length 296 [2025-03-08 00:56:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:09,953 INFO L471 AbstractCegarLoop]: Abstraction has 18381 states and 27652 transitions. [2025-03-08 00:56:09,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18381 states and 27652 transitions. [2025-03-08 00:56:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-08 00:56:09,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:09,979 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:09,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:10,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 00:56:10,179 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:10,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:10,180 INFO L85 PathProgramCache]: Analyzing trace with hash 416556439, now seen corresponding path program 1 times [2025-03-08 00:56:10,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:10,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544763985] [2025-03-08 00:56:10,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:10,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 00:56:10,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 00:56:10,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:10,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-08 00:56:10,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544763985] [2025-03-08 00:56:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544763985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:10,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492634879] [2025-03-08 00:56:10,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:10,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:10,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:10,460 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:10,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:56:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-08 00:56:11,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-08 00:56:11,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:11,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:11,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:11,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-08 00:56:11,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-08 00:56:11,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492634879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:56:11,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:56:11,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:56:11,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948964875] [2025-03-08 00:56:11,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:56:11,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:56:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:11,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:56:11,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:56:11,094 INFO L87 Difference]: Start difference. First operand 18381 states and 27652 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 00:56:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:11,225 INFO L93 Difference]: Finished difference Result 36761 states and 55305 transitions. [2025-03-08 00:56:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:56:11,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 354 [2025-03-08 00:56:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:11,253 INFO L225 Difference]: With dead ends: 36761 [2025-03-08 00:56:11,253 INFO L226 Difference]: Without dead ends: 18384 [2025-03-08 00:56:11,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:56:11,269 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:11,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1379 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18384 states. [2025-03-08 00:56:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18384 to 18384. [2025-03-08 00:56:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18384 states, 18350 states have (on average 1.50425068119891) internal successors, (27603), 18354 states have internal predecessors, (27603), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18384 states to 18384 states and 27655 transitions. [2025-03-08 00:56:11,548 INFO L78 Accepts]: Start accepts. Automaton has 18384 states and 27655 transitions. Word has length 354 [2025-03-08 00:56:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:11,548 INFO L471 AbstractCegarLoop]: Abstraction has 18384 states and 27655 transitions. [2025-03-08 00:56:11,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 00:56:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 18384 states and 27655 transitions. [2025-03-08 00:56:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-08 00:56:11,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:11,578 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:11,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 00:56:11,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:56:11,779 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:11,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1001234875, now seen corresponding path program 2 times [2025-03-08 00:56:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:11,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326374130] [2025-03-08 00:56:11,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:56:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:11,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-03-08 00:56:11,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-03-08 00:56:11,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:56:11,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-08 00:56:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326374130] [2025-03-08 00:56:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326374130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022455749] [2025-03-08 00:56:12,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:56:12,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:12,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:12,077 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:12,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:56:12,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-03-08 00:56:16,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-03-08 00:56:16,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:56:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:16,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:56:16,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-08 00:56:16,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-08 00:56:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022455749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:56:16,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:56:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:56:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485463306] [2025-03-08 00:56:16,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:56:16,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:56:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:16,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:56:16,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:56:16,191 INFO L87 Difference]: Start difference. First operand 18384 states and 27655 transitions. Second operand has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 00:56:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:16,331 INFO L93 Difference]: Finished difference Result 36768 states and 55320 transitions. [2025-03-08 00:56:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:56:16,335 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 357 [2025-03-08 00:56:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:16,372 INFO L225 Difference]: With dead ends: 36768 [2025-03-08 00:56:16,372 INFO L226 Difference]: Without dead ends: 18391 [2025-03-08 00:56:16,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:56:16,392 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:16,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1719 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18391 states. [2025-03-08 00:56:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18391 to 18391. [2025-03-08 00:56:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18391 states, 18357 states have (on average 1.5040583973416135) internal successors, (27610), 18361 states have internal predecessors, (27610), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 00:56:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18391 states to 18391 states and 27662 transitions. [2025-03-08 00:56:16,565 INFO L78 Accepts]: Start accepts. Automaton has 18391 states and 27662 transitions. Word has length 357 [2025-03-08 00:56:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 18391 states and 27662 transitions. [2025-03-08 00:56:16,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 00:56:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18391 states and 27662 transitions. [2025-03-08 00:56:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 00:56:16,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:16,583 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:16,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:16,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:16,783 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:16,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1973642057, now seen corresponding path program 3 times [2025-03-08 00:56:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987479410] [2025-03-08 00:56:16,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:56:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:16,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 367 statements into 9 equivalence classes. [2025-03-08 00:56:17,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 367 statements. [2025-03-08 00:56:17,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:56:17,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2025-03-08 00:56:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987479410] [2025-03-08 00:56:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987479410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:56:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 00:56:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155280794] [2025-03-08 00:56:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:56:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:17,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:56:17,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:56:17,455 INFO L87 Difference]: Start difference. First operand 18391 states and 27662 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:56:19,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 00:56:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:24,368 INFO L93 Difference]: Finished difference Result 36724 states and 55260 transitions. [2025-03-08 00:56:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:56:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 367 [2025-03-08 00:56:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:24,393 INFO L225 Difference]: With dead ends: 36724 [2025-03-08 00:56:24,393 INFO L226 Difference]: Without dead ends: 18526 [2025-03-08 00:56:24,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:56:24,411 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 340 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:24,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1571 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-03-08 00:56:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18526 states. [2025-03-08 00:56:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18526 to 18487. [2025-03-08 00:56:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18487 states, 18438 states have (on average 1.5027117908666883) internal successors, (27707), 18446 states have internal predecessors, (27707), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 00:56:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18487 states to 18487 states and 27789 transitions. [2025-03-08 00:56:24,690 INFO L78 Accepts]: Start accepts. Automaton has 18487 states and 27789 transitions. Word has length 367 [2025-03-08 00:56:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 18487 states and 27789 transitions. [2025-03-08 00:56:24,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:56:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18487 states and 27789 transitions. [2025-03-08 00:56:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 00:56:24,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:24,708 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:24,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 00:56:24,708 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:24,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash -936774260, now seen corresponding path program 1 times [2025-03-08 00:56:24,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:24,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371009083] [2025-03-08 00:56:24,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:24,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 00:56:24,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 00:56:24,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:24,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-03-08 00:56:25,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:25,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371009083] [2025-03-08 00:56:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371009083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:25,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375664694] [2025-03-08 00:56:25,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:25,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:25,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:25,082 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:25,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:56:25,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-08 00:56:25,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-08 00:56:25,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:25,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:56:25,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-08 00:56:26,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-08 00:56:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375664694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:56:26,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:56:26,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 18 [2025-03-08 00:56:26,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980236325] [2025-03-08 00:56:26,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:56:26,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:56:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:26,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:56:26,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:56:26,139 INFO L87 Difference]: Start difference. First operand 18487 states and 27789 transitions. Second operand has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 00:56:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:26,264 INFO L93 Difference]: Finished difference Result 36978 states and 55590 transitions. [2025-03-08 00:56:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:56:26,265 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 391 [2025-03-08 00:56:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:26,287 INFO L225 Difference]: With dead ends: 36978 [2025-03-08 00:56:26,287 INFO L226 Difference]: Without dead ends: 18504 [2025-03-08 00:56:26,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 760 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:56:26,304 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 10 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:26,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2375 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:56:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18504 states. [2025-03-08 00:56:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18504 to 18498. [2025-03-08 00:56:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18498 states, 18448 states have (on average 1.5024934952298352) internal successors, (27718), 18456 states have internal predecessors, (27718), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 36 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 00:56:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 27802 transitions. [2025-03-08 00:56:26,514 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 27802 transitions. Word has length 391 [2025-03-08 00:56:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:26,514 INFO L471 AbstractCegarLoop]: Abstraction has 18498 states and 27802 transitions. [2025-03-08 00:56:26,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-08 00:56:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 27802 transitions. [2025-03-08 00:56:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-08 00:56:26,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:26,537 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:26,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 00:56:26,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:26,742 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash -173955719, now seen corresponding path program 2 times [2025-03-08 00:56:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351601303] [2025-03-08 00:56:26,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:56:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:26,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-08 00:56:26,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-08 00:56:26,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:56:26,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-03-08 00:56:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351601303] [2025-03-08 00:56:27,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351601303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618285153] [2025-03-08 00:56:27,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:56:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:27,195 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:27,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:56:28,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-08 00:56:29,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-08 00:56:29,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:56:29,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:29,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:56:29,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2025-03-08 00:56:29,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2025-03-08 00:56:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618285153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:56:29,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:56:29,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-08 00:56:29,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170180372] [2025-03-08 00:56:29,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:56:29,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:56:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:29,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:56:29,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:56:29,344 INFO L87 Difference]: Start difference. First operand 18498 states and 27802 transitions. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:56:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:29,531 INFO L93 Difference]: Finished difference Result 36991 states and 55605 transitions. [2025-03-08 00:56:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:56:29,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 398 [2025-03-08 00:56:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:29,553 INFO L225 Difference]: With dead ends: 36991 [2025-03-08 00:56:29,553 INFO L226 Difference]: Without dead ends: 18539 [2025-03-08 00:56:29,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:56:29,570 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 47 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:29,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2036 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:56:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18539 states. [2025-03-08 00:56:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18539 to 18533. [2025-03-08 00:56:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18533 states, 18478 states have (on average 1.5019482627990042) internal successors, (27753), 18486 states have internal predecessors, (27753), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 41 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 00:56:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18533 states to 18533 states and 27847 transitions. [2025-03-08 00:56:29,753 INFO L78 Accepts]: Start accepts. Automaton has 18533 states and 27847 transitions. Word has length 398 [2025-03-08 00:56:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 18533 states and 27847 transitions. [2025-03-08 00:56:29,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:56:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 18533 states and 27847 transitions. [2025-03-08 00:56:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-08 00:56:29,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:29,769 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 00:56:29,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-08 00:56:29,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 00:56:29,971 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:29,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash -660587534, now seen corresponding path program 3 times [2025-03-08 00:56:29,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:29,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085789787] [2025-03-08 00:56:29,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:56:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:30,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 413 statements into 9 equivalence classes. [2025-03-08 00:56:30,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 413 statements. [2025-03-08 00:56:30,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:56:30,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:31,113 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-08 00:56:31,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085789787] [2025-03-08 00:56:31,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085789787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:31,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703892269] [2025-03-08 00:56:31,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:56:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:31,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:31,116 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:31,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:56:31,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 413 statements into 9 equivalence classes. [2025-03-08 00:56:33,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 413 statements. [2025-03-08 00:56:33,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:56:33,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:33,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 00:56:33,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:33,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 253 [2025-03-08 00:56:36,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:36,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 28 select indices, 28 select index equivalence classes, 378 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 378 case distinctions, treesize of input 212 treesize of output 274 [2025-03-08 00:56:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-08 00:56:37,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:44,601 WARN L286 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 182 DAG size of output: 182 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-08 00:56:51,849 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-08 00:56:57,317 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)