./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c --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/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c -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 d5746a53d1ab0f7d20d2e5362b7235e80167d7cee80ddadf160c57caf25829fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:31:12,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:31:12,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:31:12,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:31:12,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:31:12,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:31:12,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:31:12,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:31:12,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:31:12,234 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:31:12,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:31:12,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:31:12,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:31:12,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:31:12,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:12,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:31:12,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:31:12,236 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 -> d5746a53d1ab0f7d20d2e5362b7235e80167d7cee80ddadf160c57caf25829fe [2025-03-08 07:31:12,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:31:12,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:31:12,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:31:12,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:31:12,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:31:12,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2025-03-08 07:31:13,588 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b9180a3/5690799884664d7bafb9d34130db2a32/FLAGe8ecb8b7f [2025-03-08 07:31:13,798 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:31:13,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2025-03-08 07:31:13,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b9180a3/5690799884664d7bafb9d34130db2a32/FLAGe8ecb8b7f [2025-03-08 07:31:14,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b9180a3/5690799884664d7bafb9d34130db2a32 [2025-03-08 07:31:14,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:31:14,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:31:14,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:14,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:31:14,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:31:14,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14, skipping insertion in model container [2025-03-08 07:31:14,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:31:14,309 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/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[913,926] [2025-03-08 07:31:14,349 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/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[5977,5990] [2025-03-08 07:31:14,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:14,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:31:14,400 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/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[913,926] [2025-03-08 07:31:14,418 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/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[5977,5990] [2025-03-08 07:31:14,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:31:14,459 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:31:14,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14 WrapperNode [2025-03-08 07:31:14,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:31:14,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:14,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:31:14,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:31:14,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,511 INFO L138 Inliner]: procedures = 54, calls = 58, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 519 [2025-03-08 07:31:14,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:31:14,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:31:14,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:31:14,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:31:14,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,537 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:31:14,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:31:14,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:31:14,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:31:14,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:31:14,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (1/1) ... [2025-03-08 07:31:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:31:14,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:14,594 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 07:31:14,597 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 07:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:31:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-03-08 07:31:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-03-08 07:31:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:31:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:31:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:31:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:31:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:31:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:31:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:31:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:31:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:31:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:31:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:31:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:31:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:31:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:31:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:31:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:31:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:31:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:31:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:31:14,702 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:31:14,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:31:15,197 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-03-08 07:31:15,197 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:31:15,208 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:31:15,208 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:31:15,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:15 BoogieIcfgContainer [2025-03-08 07:31:15,209 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:31:15,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:31:15,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:31:15,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:31:15,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:31:14" (1/3) ... [2025-03-08 07:31:15,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a283374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:15, skipping insertion in model container [2025-03-08 07:31:15,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:31:14" (2/3) ... [2025-03-08 07:31:15,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a283374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:31:15, skipping insertion in model container [2025-03-08 07:31:15,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:31:15" (3/3) ... [2025-03-08 07:31:15,217 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2025-03-08 07:31:15,226 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:31:15,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.03.cil-1.c that has 11 procedures, 231 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-08 07:31:15,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:31:15,278 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;@11ac8b00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:31:15,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:31:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 195 states have (on average 1.5435897435897437) internal successors, (301), 200 states have internal predecessors, (301), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 07:31:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 07:31:15,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:15,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:31:15,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:15,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1746035962, now seen corresponding path program 1 times [2025-03-08 07:31:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-08 07:31:15,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:15,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 07:31:15,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 07:31:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281210655] [2025-03-08 07:31:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281210655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:15,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:15,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:15,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451995242] [2025-03-08 07:31:15,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:15,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:15,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:15,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:15,505 INFO L87 Difference]: Start difference. First operand has 231 states, 195 states have (on average 1.5435897435897437) internal successors, (301), 200 states have internal predecessors, (301), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:15,579 INFO L93 Difference]: Finished difference Result 500 states and 764 transitions. [2025-03-08 07:31:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 07:31:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:15,587 INFO L225 Difference]: With dead ends: 500 [2025-03-08 07:31:15,588 INFO L226 Difference]: Without dead ends: 275 [2025-03-08 07:31:15,591 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 07:31:15,592 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 315 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:15,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 428 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-08 07:31:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2025-03-08 07:31:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 230 states have (on average 1.482608695652174) internal successors, (341), 234 states have internal predecessors, (341), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2025-03-08 07:31:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 399 transitions. [2025-03-08 07:31:15,654 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 399 transitions. Word has length 41 [2025-03-08 07:31:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:15,655 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 399 transitions. [2025-03-08 07:31:15,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 399 transitions. [2025-03-08 07:31:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 07:31:15,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:15,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:31:15,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:31:15,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:15,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1204112175, now seen corresponding path program 1 times [2025-03-08 07:31:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685412826] [2025-03-08 07:31:15,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:15,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 07:31:15,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 07:31:15,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:15,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:15,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:15,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685412826] [2025-03-08 07:31:15,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685412826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:15,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:15,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:15,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006269331] [2025-03-08 07:31:15,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:15,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:15,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:15,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:15,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:15,717 INFO L87 Difference]: Start difference. First operand 271 states and 399 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:15,755 INFO L93 Difference]: Finished difference Result 464 states and 672 transitions. [2025-03-08 07:31:15,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-08 07:31:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:15,760 INFO L225 Difference]: With dead ends: 464 [2025-03-08 07:31:15,760 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 07:31:15,761 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 07:31:15,761 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 66 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:15,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 651 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 07:31:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 332. [2025-03-08 07:31:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 285 states have (on average 1.4701754385964911) internal successors, (419), 289 states have internal predecessors, (419), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (33), 28 states have call predecessors, (33), 28 states have call successors, (33) [2025-03-08 07:31:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 484 transitions. [2025-03-08 07:31:15,788 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 484 transitions. Word has length 42 [2025-03-08 07:31:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:15,788 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 484 transitions. [2025-03-08 07:31:15,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 484 transitions. [2025-03-08 07:31:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 07:31:15,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:15,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:31:15,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:31:15,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -486952781, now seen corresponding path program 1 times [2025-03-08 07:31:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:15,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8638867] [2025-03-08 07:31:15,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:15,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 07:31:15,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 07:31:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:15,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8638867] [2025-03-08 07:31:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8638867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:15,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623103600] [2025-03-08 07:31:15,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:15,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:15,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:15,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:15,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:15,858 INFO L87 Difference]: Start difference. First operand 332 states and 484 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:15,899 INFO L93 Difference]: Finished difference Result 657 states and 944 transitions. [2025-03-08 07:31:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:15,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-08 07:31:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:15,905 INFO L225 Difference]: With dead ends: 657 [2025-03-08 07:31:15,905 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 07:31:15,906 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 07:31:15,907 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 302 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:15,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 408 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 07:31:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 477. [2025-03-08 07:31:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 412 states have (on average 1.4296116504854368) internal successors, (589), 418 states have internal predecessors, (589), 43 states have call successors, (43), 22 states have call predecessors, (43), 20 states have return successors, (49), 37 states have call predecessors, (49), 39 states have call successors, (49) [2025-03-08 07:31:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 681 transitions. [2025-03-08 07:31:15,946 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 681 transitions. Word has length 43 [2025-03-08 07:31:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:15,947 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 681 transitions. [2025-03-08 07:31:15,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 07:31:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 681 transitions. [2025-03-08 07:31:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 07:31:15,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:15,950 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:31:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:31:15,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2000023718, now seen corresponding path program 1 times [2025-03-08 07:31:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196681924] [2025-03-08 07:31:15,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:15,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 07:31:15,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 07:31:15,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:15,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:31:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196681924] [2025-03-08 07:31:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196681924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:16,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300362567] [2025-03-08 07:31:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:16,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:16,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:16,033 INFO L87 Difference]: Start difference. First operand 477 states and 681 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:16,074 INFO L93 Difference]: Finished difference Result 948 states and 1337 transitions. [2025-03-08 07:31:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2025-03-08 07:31:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:16,080 INFO L225 Difference]: With dead ends: 948 [2025-03-08 07:31:16,080 INFO L226 Difference]: Without dead ends: 635 [2025-03-08 07:31:16,081 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 07:31:16,082 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 53 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:16,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 695 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-08 07:31:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2025-03-08 07:31:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 548 states have (on average 1.3777372262773722) internal successors, (755), 554 states have internal predecessors, (755), 57 states have call successors, (57), 30 states have call predecessors, (57), 28 states have return successors, (71), 51 states have call predecessors, (71), 53 states have call successors, (71) [2025-03-08 07:31:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 883 transitions. [2025-03-08 07:31:16,130 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 883 transitions. Word has length 58 [2025-03-08 07:31:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:16,130 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 883 transitions. [2025-03-08 07:31:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 883 transitions. [2025-03-08 07:31:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:31:16,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:16,134 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:31:16,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:31:16,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:16,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1150435851, now seen corresponding path program 1 times [2025-03-08 07:31:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:16,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748093142] [2025-03-08 07:31:16,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:16,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:16,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:16,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:31:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748093142] [2025-03-08 07:31:16,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748093142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:16,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530953225] [2025-03-08 07:31:16,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:16,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:16,330 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 07:31:16,331 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 07:31:16,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:16,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:16,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:31:16,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:31:16,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:31:16,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530953225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:16,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:31:16,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:31:16,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562029412] [2025-03-08 07:31:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:16,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:16,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:16,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:16,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:16,486 INFO L87 Difference]: Start difference. First operand 635 states and 883 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:31:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:16,527 INFO L93 Difference]: Finished difference Result 1137 states and 1560 transitions. [2025-03-08 07:31:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:16,528 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2025-03-08 07:31:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:16,532 INFO L225 Difference]: With dead ends: 1137 [2025-03-08 07:31:16,532 INFO L226 Difference]: Without dead ends: 754 [2025-03-08 07:31:16,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:16,536 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 281 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:16,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 402 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-08 07:31:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-08 07:31:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 653 states have (on average 1.3506891271056662) internal successors, (882), 659 states have internal predecessors, (882), 65 states have call successors, (65), 36 states have call predecessors, (65), 34 states have return successors, (83), 59 states have call predecessors, (83), 61 states have call successors, (83) [2025-03-08 07:31:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1030 transitions. [2025-03-08 07:31:16,570 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1030 transitions. Word has length 63 [2025-03-08 07:31:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:16,570 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1030 transitions. [2025-03-08 07:31:16,571 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 07:31:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1030 transitions. [2025-03-08 07:31:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:31:16,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:16,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:16,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:31:16,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:16,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:16,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2138455982, now seen corresponding path program 1 times [2025-03-08 07:31:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:16,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542418406] [2025-03-08 07:31:16,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:16,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:16,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:16,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:31:16,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:16,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542418406] [2025-03-08 07:31:16,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542418406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:16,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547523772] [2025-03-08 07:31:16,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:16,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:16,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:16,833 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 07:31:16,835 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 07:31:16,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:31:16,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:31:16,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:16,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:16,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 07:31:16,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:17,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:31:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:31:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547523772] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 07:31:17,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-03-08 07:31:17,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976924506] [2025-03-08 07:31:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:17,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:31:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:17,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:31:17,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:31:17,045 INFO L87 Difference]: Start difference. First operand 754 states and 1030 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:17,162 INFO L93 Difference]: Finished difference Result 804 states and 1092 transitions. [2025-03-08 07:31:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:31:17,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-03-08 07:31:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:17,167 INFO L225 Difference]: With dead ends: 804 [2025-03-08 07:31:17,167 INFO L226 Difference]: Without dead ends: 801 [2025-03-08 07:31:17,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:31:17,169 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 567 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:17,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 410 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:31:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-08 07:31:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 753. [2025-03-08 07:31:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 653 states have (on average 1.3476263399693722) internal successors, (880), 658 states have internal predecessors, (880), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (83), 59 states have call predecessors, (83), 61 states have call successors, (83) [2025-03-08 07:31:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1027 transitions. [2025-03-08 07:31:17,208 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1027 transitions. Word has length 63 [2025-03-08 07:31:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:17,209 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1027 transitions. [2025-03-08 07:31:17,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 07:31:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1027 transitions. [2025-03-08 07:31:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:31:17,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:17,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:17,217 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 07:31:17,414 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,SelfDestructingSolverStorable5 [2025-03-08 07:31:17,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1867927027, now seen corresponding path program 1 times [2025-03-08 07:31:17,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:17,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157902960] [2025-03-08 07:31:17,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:17,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:17,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:31:17,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:31:17,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:31:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157902960] [2025-03-08 07:31:17,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157902960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117193038] [2025-03-08 07:31:17,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:17,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:17,488 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 07:31:17,490 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 07:31:17,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:31:17,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:31:17,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:17,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:17,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:31:17,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:17,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:31:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:31:17,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117193038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:31:17,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:31:17,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-08 07:31:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501119084] [2025-03-08 07:31:17,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:31:17,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:31:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:17,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:31:17,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:31:17,812 INFO L87 Difference]: Start difference. First operand 753 states and 1027 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:31:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:18,128 INFO L93 Difference]: Finished difference Result 1990 states and 2704 transitions. [2025-03-08 07:31:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 07:31:18,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 64 [2025-03-08 07:31:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:18,134 INFO L225 Difference]: With dead ends: 1990 [2025-03-08 07:31:18,134 INFO L226 Difference]: Without dead ends: 1533 [2025-03-08 07:31:18,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:31:18,136 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 754 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:18,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 2384 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:31:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-03-08 07:31:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1088. [2025-03-08 07:31:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 952 states have (on average 1.3182773109243697) internal successors, (1255), 962 states have internal predecessors, (1255), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (114), 76 states have call predecessors, (114), 81 states have call successors, (114) [2025-03-08 07:31:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1453 transitions. [2025-03-08 07:31:18,196 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1453 transitions. Word has length 64 [2025-03-08 07:31:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:18,197 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1453 transitions. [2025-03-08 07:31:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 07:31:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1453 transitions. [2025-03-08 07:31:18,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:18,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:18,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:18,206 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 07:31:18,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:18,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:18,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1960862162, now seen corresponding path program 1 times [2025-03-08 07:31:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:18,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365135324] [2025-03-08 07:31:18,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:18,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:18,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:18,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:18,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365135324] [2025-03-08 07:31:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365135324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:18,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:31:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877951663] [2025-03-08 07:31:18,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:18,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:18,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:31:18,435 INFO L87 Difference]: Start difference. First operand 1088 states and 1453 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:18,469 INFO L93 Difference]: Finished difference Result 1239 states and 1681 transitions. [2025-03-08 07:31:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:18,475 INFO L225 Difference]: With dead ends: 1239 [2025-03-08 07:31:18,475 INFO L226 Difference]: Without dead ends: 1088 [2025-03-08 07:31:18,476 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 07:31:18,476 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 230 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:18,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 408 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-03-08 07:31:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2025-03-08 07:31:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 952 states have (on average 1.3172268907563025) internal successors, (1254), 962 states have internal predecessors, (1254), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (114), 76 states have call predecessors, (114), 81 states have call successors, (114) [2025-03-08 07:31:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1452 transitions. [2025-03-08 07:31:18,526 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1452 transitions. Word has length 78 [2025-03-08 07:31:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:18,526 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1452 transitions. [2025-03-08 07:31:18,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1452 transitions. [2025-03-08 07:31:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:18,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:18,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:18,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:31:18,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:18,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1006633267, now seen corresponding path program 1 times [2025-03-08 07:31:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:18,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210927888] [2025-03-08 07:31:18,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:18,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:18,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:18,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:18,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210927888] [2025-03-08 07:31:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210927888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:18,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:18,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:31:18,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404030999] [2025-03-08 07:31:18,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:18,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:31:18,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:18,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:31:18,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:31:18,600 INFO L87 Difference]: Start difference. First operand 1088 states and 1452 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:18,923 INFO L93 Difference]: Finished difference Result 1392 states and 1916 transitions. [2025-03-08 07:31:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:31:18,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:18,930 INFO L225 Difference]: With dead ends: 1392 [2025-03-08 07:31:18,930 INFO L226 Difference]: Without dead ends: 1246 [2025-03-08 07:31:18,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:18,933 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 509 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:18,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 779 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:31:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-08 07:31:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1233. [2025-03-08 07:31:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1078 states have (on average 1.344155844155844) internal successors, (1449), 1089 states have internal predecessors, (1449), 96 states have call successors, (96), 56 states have call predecessors, (96), 57 states have return successors, (127), 88 states have call predecessors, (127), 93 states have call successors, (127) [2025-03-08 07:31:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1672 transitions. [2025-03-08 07:31:19,002 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1672 transitions. Word has length 78 [2025-03-08 07:31:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:19,002 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1672 transitions. [2025-03-08 07:31:19,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1672 transitions. [2025-03-08 07:31:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:19,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:19,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:19,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:31:19,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:19,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1137027023, now seen corresponding path program 1 times [2025-03-08 07:31:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589480169] [2025-03-08 07:31:19,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:19,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:19,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:19,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589480169] [2025-03-08 07:31:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589480169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516954336] [2025-03-08 07:31:19,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:19,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:19,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:19,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:19,096 INFO L87 Difference]: Start difference. First operand 1233 states and 1672 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:19,517 INFO L93 Difference]: Finished difference Result 1705 states and 2393 transitions. [2025-03-08 07:31:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:19,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:19,522 INFO L225 Difference]: With dead ends: 1705 [2025-03-08 07:31:19,522 INFO L226 Difference]: Without dead ends: 1414 [2025-03-08 07:31:19,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:31:19,523 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 500 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:19,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1377 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:31:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-03-08 07:31:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1369. [2025-03-08 07:31:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1195 states have (on average 1.3606694560669457) internal successors, (1626), 1207 states have internal predecessors, (1626), 108 states have call successors, (108), 62 states have call predecessors, (108), 64 states have return successors, (142), 101 states have call predecessors, (142), 105 states have call successors, (142) [2025-03-08 07:31:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1876 transitions. [2025-03-08 07:31:19,575 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1876 transitions. Word has length 78 [2025-03-08 07:31:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:19,575 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1876 transitions. [2025-03-08 07:31:19,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1876 transitions. [2025-03-08 07:31:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:19,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:19,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:19,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:31:19,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:19,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1345725326, now seen corresponding path program 1 times [2025-03-08 07:31:19,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:19,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013650061] [2025-03-08 07:31:19,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:19,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:19,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:19,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:19,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013650061] [2025-03-08 07:31:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013650061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:19,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976559605] [2025-03-08 07:31:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:19,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:19,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:19,645 INFO L87 Difference]: Start difference. First operand 1369 states and 1876 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:20,059 INFO L93 Difference]: Finished difference Result 2129 states and 3036 transitions. [2025-03-08 07:31:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:20,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:20,066 INFO L225 Difference]: With dead ends: 2129 [2025-03-08 07:31:20,067 INFO L226 Difference]: Without dead ends: 1702 [2025-03-08 07:31:20,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:31:20,069 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 495 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:20,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1361 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:31:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-03-08 07:31:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1654. [2025-03-08 07:31:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1440 states have (on average 1.3881944444444445) internal successors, (1999), 1456 states have internal predecessors, (1999), 132 states have call successors, (132), 74 states have call predecessors, (132), 80 states have return successors, (178), 127 states have call predecessors, (178), 129 states have call successors, (178) [2025-03-08 07:31:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2309 transitions. [2025-03-08 07:31:20,151 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2309 transitions. Word has length 78 [2025-03-08 07:31:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:20,151 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2309 transitions. [2025-03-08 07:31:20,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2309 transitions. [2025-03-08 07:31:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:20,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:20,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:31:20,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1141394449, now seen corresponding path program 1 times [2025-03-08 07:31:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732815282] [2025-03-08 07:31:20,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:20,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:20,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:20,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:20,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732815282] [2025-03-08 07:31:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732815282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626984946] [2025-03-08 07:31:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:20,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:20,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:20,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:20,226 INFO L87 Difference]: Start difference. First operand 1654 states and 2309 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:20,700 INFO L93 Difference]: Finished difference Result 3024 states and 4419 transitions. [2025-03-08 07:31:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:20,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:20,709 INFO L225 Difference]: With dead ends: 3024 [2025-03-08 07:31:20,710 INFO L226 Difference]: Without dead ends: 2312 [2025-03-08 07:31:20,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:31:20,712 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 490 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:20,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1349 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:31:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-03-08 07:31:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2257. [2025-03-08 07:31:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 1957 states have (on average 1.4261624936126724) internal successors, (2791), 1987 states have internal predecessors, (2791), 180 states have call successors, (180), 98 states have call predecessors, (180), 118 states have return successors, (274), 179 states have call predecessors, (274), 177 states have call successors, (274) [2025-03-08 07:31:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3245 transitions. [2025-03-08 07:31:20,825 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3245 transitions. Word has length 78 [2025-03-08 07:31:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:20,826 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3245 transitions. [2025-03-08 07:31:20,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3245 transitions. [2025-03-08 07:31:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:20,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:20,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:20,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:31:20,829 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:20,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:20,829 INFO L85 PathProgramCache]: Analyzing trace with hash -25301870, now seen corresponding path program 1 times [2025-03-08 07:31:20,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:20,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716079617] [2025-03-08 07:31:20,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:20,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:20,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:20,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:20,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:20,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716079617] [2025-03-08 07:31:20,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716079617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:20,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:20,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:20,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086873944] [2025-03-08 07:31:20,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:20,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:20,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:20,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:20,895 INFO L87 Difference]: Start difference. First operand 2257 states and 3245 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:21,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:21,454 INFO L93 Difference]: Finished difference Result 5135 states and 7758 transitions. [2025-03-08 07:31:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:21,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:21,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:21,471 INFO L225 Difference]: With dead ends: 5135 [2025-03-08 07:31:21,471 INFO L226 Difference]: Without dead ends: 3820 [2025-03-08 07:31:21,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:31:21,476 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 518 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:21,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1324 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2025-03-08 07:31:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3520. [2025-03-08 07:31:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 3038 states have (on average 1.4690585911784069) internal successors, (4463), 3114 states have internal predecessors, (4463), 268 states have call successors, (268), 146 states have call predecessors, (268), 212 states have return successors, (554), 275 states have call predecessors, (554), 265 states have call successors, (554) [2025-03-08 07:31:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 5285 transitions. [2025-03-08 07:31:21,735 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 5285 transitions. Word has length 78 [2025-03-08 07:31:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:21,735 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 5285 transitions. [2025-03-08 07:31:21,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 5285 transitions. [2025-03-08 07:31:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:21,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:21,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:21,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:31:21,741 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:21,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash 75610097, now seen corresponding path program 1 times [2025-03-08 07:31:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433813444] [2025-03-08 07:31:21,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:21,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:21,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:21,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:21,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:21,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:21,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:21,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433813444] [2025-03-08 07:31:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433813444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880243999] [2025-03-08 07:31:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:21,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:21,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:21,825 INFO L87 Difference]: Start difference. First operand 3520 states and 5285 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:22,479 INFO L93 Difference]: Finished difference Result 9214 states and 14632 transitions. [2025-03-08 07:31:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:22,511 INFO L225 Difference]: With dead ends: 9214 [2025-03-08 07:31:22,511 INFO L226 Difference]: Without dead ends: 6636 [2025-03-08 07:31:22,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:31:22,520 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 553 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:22,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1308 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2025-03-08 07:31:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 6067. [2025-03-08 07:31:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6067 states, 5175 states have (on average 1.4931400966183574) internal successors, (7727), 5397 states have internal predecessors, (7727), 436 states have call successors, (436), 242 states have call predecessors, (436), 454 states have return successors, (1490), 459 states have call predecessors, (1490), 433 states have call successors, (1490) [2025-03-08 07:31:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6067 states to 6067 states and 9653 transitions. [2025-03-08 07:31:22,983 INFO L78 Accepts]: Start accepts. Automaton has 6067 states and 9653 transitions. Word has length 78 [2025-03-08 07:31:22,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:22,983 INFO L471 AbstractCegarLoop]: Abstraction has 6067 states and 9653 transitions. [2025-03-08 07:31:22,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 6067 states and 9653 transitions. [2025-03-08 07:31:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:22,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:22,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:22,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:31:22,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 355959986, now seen corresponding path program 1 times [2025-03-08 07:31:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658776256] [2025-03-08 07:31:22,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:22,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:23,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:23,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:23,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:23,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658776256] [2025-03-08 07:31:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658776256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:23,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:31:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671540572] [2025-03-08 07:31:23,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:23,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:31:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:23,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:31:23,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:23,077 INFO L87 Difference]: Start difference. First operand 6067 states and 9653 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:23,999 INFO L93 Difference]: Finished difference Result 16883 states and 28882 transitions. [2025-03-08 07:31:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:31:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:24,068 INFO L225 Difference]: With dead ends: 16883 [2025-03-08 07:31:24,068 INFO L226 Difference]: Without dead ends: 11758 [2025-03-08 07:31:24,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:31:24,086 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 486 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:24,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1286 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:31:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11758 states. [2025-03-08 07:31:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11758 to 11419. [2025-03-08 07:31:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11419 states, 9561 states have (on average 1.4974375065369732) internal successors, (14317), 10237 states have internal predecessors, (14317), 756 states have call successors, (756), 434 states have call predecessors, (756), 1100 states have return successors, (4882), 811 states have call predecessors, (4882), 753 states have call successors, (4882) [2025-03-08 07:31:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11419 states to 11419 states and 19955 transitions. [2025-03-08 07:31:24,927 INFO L78 Accepts]: Start accepts. Automaton has 11419 states and 19955 transitions. Word has length 78 [2025-03-08 07:31:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:24,928 INFO L471 AbstractCegarLoop]: Abstraction has 11419 states and 19955 transitions. [2025-03-08 07:31:24,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 11419 states and 19955 transitions. [2025-03-08 07:31:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:24,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:24,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:24,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:31:24,938 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:24,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash 986418611, now seen corresponding path program 1 times [2025-03-08 07:31:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:24,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891896346] [2025-03-08 07:31:24,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:24,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:24,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:24,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:24,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891896346] [2025-03-08 07:31:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891896346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:31:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018399347] [2025-03-08 07:31:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:31:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:24,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:31:24,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:31:24,990 INFO L87 Difference]: Start difference. First operand 11419 states and 19955 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:25,637 INFO L93 Difference]: Finished difference Result 22090 states and 39231 transitions. [2025-03-08 07:31:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:31:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:25,684 INFO L225 Difference]: With dead ends: 22090 [2025-03-08 07:31:25,684 INFO L226 Difference]: Without dead ends: 11614 [2025-03-08 07:31:25,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:31:25,713 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:25,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1270 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11614 states. [2025-03-08 07:31:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11614 to 11614. [2025-03-08 07:31:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11614 states, 9756 states have (on average 1.4874948749487495) internal successors, (14512), 10432 states have internal predecessors, (14512), 756 states have call successors, (756), 434 states have call predecessors, (756), 1100 states have return successors, (4882), 811 states have call predecessors, (4882), 753 states have call successors, (4882) [2025-03-08 07:31:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11614 states to 11614 states and 20150 transitions. [2025-03-08 07:31:26,361 INFO L78 Accepts]: Start accepts. Automaton has 11614 states and 20150 transitions. Word has length 78 [2025-03-08 07:31:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:26,361 INFO L471 AbstractCegarLoop]: Abstraction has 11614 states and 20150 transitions. [2025-03-08 07:31:26,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 11614 states and 20150 transitions. [2025-03-08 07:31:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:26,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:26,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:26,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:31:26,369 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:26,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1955999634, now seen corresponding path program 1 times [2025-03-08 07:31:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402256451] [2025-03-08 07:31:26,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:26,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:26,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:26,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402256451] [2025-03-08 07:31:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402256451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:26,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:31:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063582922] [2025-03-08 07:31:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:26,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:31:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:26,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:31:26,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:31:26,412 INFO L87 Difference]: Start difference. First operand 11614 states and 20150 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:27,435 INFO L93 Difference]: Finished difference Result 32606 states and 57659 transitions. [2025-03-08 07:31:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:31:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:27,531 INFO L225 Difference]: With dead ends: 32606 [2025-03-08 07:31:27,532 INFO L226 Difference]: Without dead ends: 21935 [2025-03-08 07:31:27,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:31:27,566 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 495 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:27,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 962 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:31:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21935 states. [2025-03-08 07:31:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21935 to 21866. [2025-03-08 07:31:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21866 states, 18348 states have (on average 1.4913342053629823) internal successors, (27363), 19690 states have internal predecessors, (27363), 1368 states have call successors, (1368), 816 states have call predecessors, (1368), 2148 states have return successors, (9527), 1423 states have call predecessors, (9527), 1365 states have call successors, (9527) [2025-03-08 07:31:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21866 states to 21866 states and 38258 transitions. [2025-03-08 07:31:29,306 INFO L78 Accepts]: Start accepts. Automaton has 21866 states and 38258 transitions. Word has length 78 [2025-03-08 07:31:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:29,307 INFO L471 AbstractCegarLoop]: Abstraction has 21866 states and 38258 transitions. [2025-03-08 07:31:29,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 21866 states and 38258 transitions. [2025-03-08 07:31:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:29,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:29,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:31:29,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash -120834001, now seen corresponding path program 1 times [2025-03-08 07:31:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:29,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800891238] [2025-03-08 07:31:29,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:29,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:29,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:29,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:29,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:29,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:29,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800891238] [2025-03-08 07:31:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800891238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:29,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:29,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:31:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764285363] [2025-03-08 07:31:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:29,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:31:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:29,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:31:29,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:31:29,363 INFO L87 Difference]: Start difference. First operand 21866 states and 38258 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:30,237 INFO L93 Difference]: Finished difference Result 42984 states and 76059 transitions. [2025-03-08 07:31:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:31:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:30,333 INFO L225 Difference]: With dead ends: 42984 [2025-03-08 07:31:30,333 INFO L226 Difference]: Without dead ends: 22061 [2025-03-08 07:31:30,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:31:30,377 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:30,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1270 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22061 states. [2025-03-08 07:31:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22061 to 22061. [2025-03-08 07:31:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22061 states, 18543 states have (on average 1.4826619209405167) internal successors, (27493), 19885 states have internal predecessors, (27493), 1368 states have call successors, (1368), 816 states have call predecessors, (1368), 2148 states have return successors, (9527), 1423 states have call predecessors, (9527), 1365 states have call successors, (9527) [2025-03-08 07:31:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22061 states to 22061 states and 38388 transitions. [2025-03-08 07:31:31,539 INFO L78 Accepts]: Start accepts. Automaton has 22061 states and 38388 transitions. Word has length 78 [2025-03-08 07:31:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:31,540 INFO L471 AbstractCegarLoop]: Abstraction has 22061 states and 38388 transitions. [2025-03-08 07:31:31,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22061 states and 38388 transitions. [2025-03-08 07:31:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:31:31,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:31,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:31:31,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:31:31,547 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:31,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash 3239246, now seen corresponding path program 1 times [2025-03-08 07:31:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:31,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303743414] [2025-03-08 07:31:31,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:31,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:31:31,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:31:31,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:31,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:31:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303743414] [2025-03-08 07:31:31,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303743414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:31,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:31:31,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:31:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659680580] [2025-03-08 07:31:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:31,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:31:31,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:31,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:31:31,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:31:31,589 INFO L87 Difference]: Start difference. First operand 22061 states and 38388 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:35,791 INFO L93 Difference]: Finished difference Result 96453 states and 170324 transitions. [2025-03-08 07:31:35,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:31:35,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 07:31:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:36,197 INFO L225 Difference]: With dead ends: 96453 [2025-03-08 07:31:36,198 INFO L226 Difference]: Without dead ends: 75335 [2025-03-08 07:31:36,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:31:36,276 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 1156 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:36,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 1103 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:31:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75335 states. [2025-03-08 07:31:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75335 to 69845. [2025-03-08 07:31:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69845 states, 58525 states have (on average 1.4756258009397694) internal successors, (86361), 62669 states have internal predecessors, (86361), 4614 states have call successors, (4614), 2768 states have call predecessors, (4614), 6704 states have return successors, (27933), 4471 states have call predecessors, (27933), 4611 states have call successors, (27933) [2025-03-08 07:31:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69845 states to 69845 states and 118908 transitions. [2025-03-08 07:31:40,964 INFO L78 Accepts]: Start accepts. Automaton has 69845 states and 118908 transitions. Word has length 78 [2025-03-08 07:31:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:31:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 69845 states and 118908 transitions. [2025-03-08 07:31:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:31:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 69845 states and 118908 transitions. [2025-03-08 07:31:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 07:31:40,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:31:40,977 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:31:40,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:31:40,977 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:31:40,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:31:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1257770531, now seen corresponding path program 1 times [2025-03-08 07:31:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:31:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086389477] [2025-03-08 07:31:40,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:31:40,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:31:40,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:31:40,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:40,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 07:31:41,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:31:41,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086389477] [2025-03-08 07:31:41,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086389477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:31:41,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697990225] [2025-03-08 07:31:41,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:31:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:31:41,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:31:41,017 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 07:31:41,020 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 07:31:41,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 07:31:41,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 07:31:41,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:31:41,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:31:41,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 07:31:41,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:31:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 07:31:41,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:31:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697990225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:31:41,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:31:41,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:31:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776276301] [2025-03-08 07:31:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:31:41,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:31:41,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:31:41,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:31:41,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:41,112 INFO L87 Difference]: Start difference. First operand 69845 states and 118908 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 07:31:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:31:44,300 INFO L93 Difference]: Finished difference Result 70445 states and 119703 transitions. [2025-03-08 07:31:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:31:44,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2025-03-08 07:31:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:31:44,663 INFO L225 Difference]: With dead ends: 70445 [2025-03-08 07:31:44,663 INFO L226 Difference]: Without dead ends: 69733 [2025-03-08 07:31:44,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:31:44,717 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 285 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:31:44,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 423 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:31:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69733 states.