./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 43061c6fd2cf55dd1721985927e668f0444e5f80f3517bfb8a4405f126e779da --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:02:53,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:02:53,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:02:53,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:02:53,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:02:53,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:02:53,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:02:53,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:02:53,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:02:53,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:02:53,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:02:53,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:02:53,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:02:53,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:02:53,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:02:53,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:53,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:53,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:02:53,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:02:53,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:02:53,268 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-jdk21/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 -> 43061c6fd2cf55dd1721985927e668f0444e5f80f3517bfb8a4405f126e779da [2025-01-09 06:02:53,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:02:53,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:02:53,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:02:53,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:02:53,448 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:02:53,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2025-01-09 06:02:54,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e606ba0f6/4f6526d8893b4d33b2bb32b740596c08/FLAG60befae66 [2025-01-09 06:02:54,946 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:02:54,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2025-01-09 06:02:54,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e606ba0f6/4f6526d8893b4d33b2bb32b740596c08/FLAG60befae66 [2025-01-09 06:02:55,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e606ba0f6/4f6526d8893b4d33b2bb32b740596c08 [2025-01-09 06:02:55,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:02:55,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:02:55,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:02:55,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:02:55,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:02:55,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5068b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55, skipping insertion in model container [2025-01-09 06:02:55,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:02:55,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c[913,926] [2025-01-09 06:02:55,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c[5977,5990] [2025-01-09 06:02:55,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:02:55,541 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:02:55,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c[913,926] [2025-01-09 06:02:55,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c[5977,5990] [2025-01-09 06:02:55,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:02:55,620 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:02:55,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55 WrapperNode [2025-01-09 06:02:55,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:02:55,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:02:55,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:02:55,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:02:55,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,671 INFO L138 Inliner]: procedures = 66, calls = 76, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 861 [2025-01-09 06:02:55,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:02:55,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:02:55,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:02:55,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:02:55,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,702 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-01-09 06:02:55,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:02:55,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:02:55,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:02:55,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:02:55,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (1/1) ... [2025-01-09 06:02:55,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:02:55,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:55,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 06:02:55,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 06:02:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:02:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:02:55,777 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:02:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-01-09 06:02:55,777 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-01-09 06:02:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:02:55,777 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:02:55,777 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:02:55,777 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:02:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:02:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:02:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:02:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:02:55,778 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:02:55,778 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:02:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:02:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:02:55,779 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:02:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:02:55,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:02:55,779 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:02:55,779 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:02:55,780 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-01-09 06:02:55,780 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-01-09 06:02:55,884 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:02:55,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:02:56,497 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-01-09 06:02:56,497 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:02:56,517 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:02:56,518 INFO L312 CfgBuilder]: Removed 16 assume(true) statements. [2025-01-09 06:02:56,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:02:56 BoogieIcfgContainer [2025-01-09 06:02:56,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:02:56,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:02:56,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:02:56,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:02:56,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:02:55" (1/3) ... [2025-01-09 06:02:56,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f81c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:02:56, skipping insertion in model container [2025-01-09 06:02:56,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:02:55" (2/3) ... [2025-01-09 06:02:56,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f81c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:02:56, skipping insertion in model container [2025-01-09 06:02:56,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:02:56" (3/3) ... [2025-01-09 06:02:56,529 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2025-01-09 06:02:56,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:02:56,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.09.cil-2.c that has 11 procedures, 381 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-01-09 06:02:56,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:02:56,608 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;@4781ee6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:02:56,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:02:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 381 states, 339 states have (on average 1.5958702064896755) internal successors, (541), 344 states have internal predecessors, (541), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 06:02:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 06:02:56,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:56,620 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-01-09 06:02:56,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:56,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2047522678, now seen corresponding path program 1 times [2025-01-09 06:02:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:56,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161518110] [2025-01-09 06:02:56,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:56,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 06:02:56,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 06:02:56,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:02:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161518110] [2025-01-09 06:02:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161518110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:56,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007779448] [2025-01-09 06:02:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:56,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:56,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:56,877 INFO L87 Difference]: Start difference. First operand has 381 states, 339 states have (on average 1.5958702064896755) internal successors, (541), 344 states have internal predecessors, (541), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) 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-01-09 06:02:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:56,983 INFO L93 Difference]: Finished difference Result 794 states and 1256 transitions. [2025-01-09 06:02:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:56,984 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-01-09 06:02:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:56,992 INFO L225 Difference]: With dead ends: 794 [2025-01-09 06:02:56,992 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 06:02:56,995 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-01-09 06:02:56,997 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 560 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 674 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-01-09 06:02:56,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 674 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 06:02:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2025-01-09 06:02:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 374 states have (on average 1.5374331550802138) internal successors, (575), 378 states have internal predecessors, (575), 35 states have call successors, (35), 12 states have call predecessors, (35), 10 states have return successors, (35), 31 states have call predecessors, (35), 31 states have call successors, (35) [2025-01-09 06:02:57,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 645 transitions. [2025-01-09 06:02:57,040 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 645 transitions. Word has length 41 [2025-01-09 06:02:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:57,041 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 645 transitions. [2025-01-09 06:02:57,041 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-01-09 06:02:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 645 transitions. [2025-01-09 06:02:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 06:02:57,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:57,044 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-01-09 06:02:57,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:02:57,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:57,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:57,046 INFO L85 PathProgramCache]: Analyzing trace with hash -570473908, now seen corresponding path program 1 times [2025-01-09 06:02:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385726385] [2025-01-09 06:02:57,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:57,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 06:02:57,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 06:02:57,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:57,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:02:57,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:57,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385726385] [2025-01-09 06:02:57,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385726385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:57,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:57,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:57,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701242883] [2025-01-09 06:02:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:57,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:57,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:57,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:57,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:57,150 INFO L87 Difference]: Start difference. First operand 421 states and 645 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-01-09 06:02:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:57,189 INFO L93 Difference]: Finished difference Result 614 states and 918 transitions. [2025-01-09 06:02:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:57,190 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-01-09 06:02:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:57,193 INFO L225 Difference]: With dead ends: 614 [2025-01-09 06:02:57,193 INFO L226 Difference]: Without dead ends: 507 [2025-01-09 06:02:57,193 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-01-09 06:02:57,194 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 66 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1143 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-01-09 06:02:57,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1143 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-09 06:02:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 482. [2025-01-09 06:02:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 429 states have (on average 1.5221445221445222) internal successors, (653), 433 states have internal predecessors, (653), 38 states have call successors, (38), 15 states have call predecessors, (38), 13 states have return successors, (39), 34 states have call predecessors, (39), 34 states have call successors, (39) [2025-01-09 06:02:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 730 transitions. [2025-01-09 06:02:57,216 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 730 transitions. Word has length 42 [2025-01-09 06:02:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:57,216 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 730 transitions. [2025-01-09 06:02:57,216 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-01-09 06:02:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 730 transitions. [2025-01-09 06:02:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 06:02:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:57,222 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-01-09 06:02:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:02:57,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:57,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1465320519, now seen corresponding path program 1 times [2025-01-09 06:02:57,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:57,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116297600] [2025-01-09 06:02:57,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:57,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 06:02:57,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 06:02:57,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:57,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:02:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:57,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116297600] [2025-01-09 06:02:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116297600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:57,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:57,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165930508] [2025-01-09 06:02:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:57,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:57,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:57,277 INFO L87 Difference]: Start difference. First operand 482 states and 730 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-01-09 06:02:57,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:57,324 INFO L93 Difference]: Finished difference Result 807 states and 1190 transitions. [2025-01-09 06:02:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:57,325 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-01-09 06:02:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:57,328 INFO L225 Difference]: With dead ends: 807 [2025-01-09 06:02:57,328 INFO L226 Difference]: Without dead ends: 639 [2025-01-09 06:02:57,329 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-01-09 06:02:57,329 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 548 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 654 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-01-09 06:02:57,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 654 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-01-09 06:02:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 627. [2025-01-09 06:02:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 556 states have (on average 1.4802158273381294) internal successors, (823), 562 states have internal predecessors, (823), 49 states have call successors, (49), 22 states have call predecessors, (49), 20 states have return successors, (55), 43 states have call predecessors, (55), 45 states have call successors, (55) [2025-01-09 06:02:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 927 transitions. [2025-01-09 06:02:57,358 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 927 transitions. Word has length 43 [2025-01-09 06:02:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:57,358 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 927 transitions. [2025-01-09 06:02:57,358 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-01-09 06:02:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2025-01-09 06:02:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 06:02:57,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:57,360 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-01-09 06:02:57,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:02:57,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:57,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash -760695289, now seen corresponding path program 1 times [2025-01-09 06:02:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:57,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448504342] [2025-01-09 06:02:57,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:57,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 06:02:57,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 06:02:57,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:57,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 06:02:57,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448504342] [2025-01-09 06:02:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448504342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:02:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855507679] [2025-01-09 06:02:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:57,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:57,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:02:57,454 INFO L87 Difference]: Start difference. First operand 627 states and 927 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-01-09 06:02:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:57,506 INFO L93 Difference]: Finished difference Result 1098 states and 1583 transitions. [2025-01-09 06:02:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:57,506 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-01-09 06:02:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:57,511 INFO L225 Difference]: With dead ends: 1098 [2025-01-09 06:02:57,512 INFO L226 Difference]: Without dead ends: 785 [2025-01-09 06:02:57,529 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-01-09 06:02:57,529 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 53 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1185 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-01-09 06:02:57,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1185 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-01-09 06:02:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2025-01-09 06:02:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 692 states have (on average 1.4291907514450868) internal successors, (989), 698 states have internal predecessors, (989), 63 states have call successors, (63), 30 states have call predecessors, (63), 28 states have return successors, (77), 57 states have call predecessors, (77), 59 states have call successors, (77) [2025-01-09 06:02:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1129 transitions. [2025-01-09 06:02:57,571 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1129 transitions. Word has length 58 [2025-01-09 06:02:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:57,571 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1129 transitions. [2025-01-09 06:02:57,571 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-01-09 06:02:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1129 transitions. [2025-01-09 06:02:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:02:57,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:57,574 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-01-09 06:02:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:02:57,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:57,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1646120570, now seen corresponding path program 1 times [2025-01-09 06:02:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570869854] [2025-01-09 06:02:57,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:57,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:57,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:57,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:57,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:02:57,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570869854] [2025-01-09 06:02:57,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570869854] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:57,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713513379] [2025-01-09 06:02:57,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:57,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:57,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:57,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:02:57,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 06:02:57,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:57,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:57,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:57,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:57,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 06:02:57,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 06:02:57,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:02:57,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713513379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:57,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:02:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:02:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360418500] [2025-01-09 06:02:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:57,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:02:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:57,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:02:57,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:02:57,841 INFO L87 Difference]: Start difference. First operand 785 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 06:02:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:57,891 INFO L93 Difference]: Finished difference Result 1286 states and 1817 transitions. [2025-01-09 06:02:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:02:57,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (4), 3 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-01-09 06:02:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:57,898 INFO L225 Difference]: With dead ends: 1286 [2025-01-09 06:02:57,898 INFO L226 Difference]: Without dead ends: 903 [2025-01-09 06:02:57,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-01-09 06:02:57,900 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 67 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:57,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1164 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:02:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-01-09 06:02:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 863. [2025-01-09 06:02:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 762 states have (on average 1.39501312335958) internal successors, (1063), 768 states have internal predecessors, (1063), 67 states have call successors, (67), 34 states have call predecessors, (67), 32 states have return successors, (89), 61 states have call predecessors, (89), 63 states have call successors, (89) [2025-01-09 06:02:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1219 transitions. [2025-01-09 06:02:57,969 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1219 transitions. Word has length 63 [2025-01-09 06:02:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:57,969 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1219 transitions. [2025-01-09 06:02:57,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 06:02:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1219 transitions. [2025-01-09 06:02:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:02:57,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:57,977 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-01-09 06:02:57,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 06:02:58,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:58,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:58,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:58,185 INFO L85 PathProgramCache]: Analyzing trace with hash -468874951, now seen corresponding path program 1 times [2025-01-09 06:02:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684661787] [2025-01-09 06:02:58,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:58,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:58,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:58,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:58,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:02:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684661787] [2025-01-09 06:02:58,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684661787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:58,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023833779] [2025-01-09 06:02:58,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:58,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:58,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:02:58,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:02:58,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:02:58,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:02:58,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:58,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:58,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 06:02:58,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:02:58,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:02:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:02:58,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023833779] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:58,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 06:02:58,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2025-01-09 06:02:58,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946276373] [2025-01-09 06:02:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:58,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:02:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:58,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:02:58,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:02:58,561 INFO L87 Difference]: Start difference. First operand 863 states and 1219 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-01-09 06:02:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:58,745 INFO L93 Difference]: Finished difference Result 913 states and 1279 transitions. [2025-01-09 06:02:58,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:02:58,746 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-01-09 06:02:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:58,750 INFO L225 Difference]: With dead ends: 913 [2025-01-09 06:02:58,750 INFO L226 Difference]: Without dead ends: 910 [2025-01-09 06:02:58,751 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-01-09 06:02:58,752 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1030 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:58,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 655 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:02:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-01-09 06:02:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 862. [2025-01-09 06:02:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 762 states have (on average 1.3923884514435696) internal successors, (1061), 767 states have internal predecessors, (1061), 66 states have call successors, (66), 34 states have call predecessors, (66), 32 states have return successors, (89), 61 states have call predecessors, (89), 63 states have call successors, (89) [2025-01-09 06:02:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1216 transitions. [2025-01-09 06:02:58,799 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1216 transitions. Word has length 63 [2025-01-09 06:02:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:58,799 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1216 transitions. [2025-01-09 06:02:58,799 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-01-09 06:02:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1216 transitions. [2025-01-09 06:02:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:02:58,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:58,801 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-01-09 06:02:58,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 06:02:59,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:59,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:59,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1651362884, now seen corresponding path program 1 times [2025-01-09 06:02:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784947716] [2025-01-09 06:02:59,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:59,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:02:59,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:02:59,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:59,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:02:59,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784947716] [2025-01-09 06:02:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784947716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:02:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629422155] [2025-01-09 06:02:59,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:02:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:02:59,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:02:59,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 06:02:59,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:02:59,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:02:59,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:59,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:59,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:02:59,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:02:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:02:59,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:02:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:02:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629422155] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:02:59,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:02:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-01-09 06:02:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878027599] [2025-01-09 06:02:59,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:02:59,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:02:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:59,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:02:59,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:02:59,427 INFO L87 Difference]: Start difference. First operand 862 states and 1216 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-01-09 06:02:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:59,845 INFO L93 Difference]: Finished difference Result 2009 states and 2764 transitions. [2025-01-09 06:02:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 06:02:59,846 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-01-09 06:02:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:59,853 INFO L225 Difference]: With dead ends: 2009 [2025-01-09 06:02:59,853 INFO L226 Difference]: Without dead ends: 1594 [2025-01-09 06:02:59,856 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-01-09 06:02:59,856 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 696 mSDsluCounter, 3839 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 4488 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:59,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 4488 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2025-01-09 06:02:59,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1255. [2025-01-09 06:02:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1112 states have (on average 1.339928057553957) internal successors, (1490), 1125 states have internal predecessors, (1490), 89 states have call successors, (89), 51 states have call predecessors, (89), 52 states have return successors, (130), 79 states have call predecessors, (130), 86 states have call successors, (130) [2025-01-09 06:02:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1709 transitions. [2025-01-09 06:02:59,975 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1709 transitions. Word has length 64 [2025-01-09 06:02:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:59,975 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1709 transitions. [2025-01-09 06:02:59,975 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-01-09 06:02:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1709 transitions. [2025-01-09 06:02:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 06:02:59,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:59,978 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-01-09 06:02:59,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 06:03:00,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:00,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:00,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:00,186 INFO L85 PathProgramCache]: Analyzing trace with hash -149195141, now seen corresponding path program 1 times [2025-01-09 06:03:00,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:00,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250884416] [2025-01-09 06:03:00,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:00,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 06:03:00,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 06:03:00,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:00,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 06:03:00,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250884416] [2025-01-09 06:03:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250884416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085322023] [2025-01-09 06:03:00,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:00,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:00,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:00,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:03:00,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 06:03:00,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 06:03:00,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 06:03:00,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:00,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:00,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 06:03:00,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 06:03:00,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:03:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085322023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:00,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:03:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:03:00,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577595902] [2025-01-09 06:03:00,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:00,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:00,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:00,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:00,411 INFO L87 Difference]: Start difference. First operand 1255 states and 1709 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-01-09 06:03:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:00,482 INFO L93 Difference]: Finished difference Result 1828 states and 2446 transitions. [2025-01-09 06:03:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:00,482 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-01-09 06:03:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:00,489 INFO L225 Difference]: With dead ends: 1828 [2025-01-09 06:03:00,489 INFO L226 Difference]: Without dead ends: 1183 [2025-01-09 06:03:00,491 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-01-09 06:03:00,491 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 530 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 664 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-01-09 06:03:00,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 664 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-01-09 06:03:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1175. [2025-01-09 06:03:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1040 states have (on average 1.3326923076923076) internal successors, (1386), 1055 states have internal predecessors, (1386), 85 states have call successors, (85), 47 states have call predecessors, (85), 48 states have return successors, (118), 73 states have call predecessors, (118), 82 states have call successors, (118) [2025-01-09 06:03:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1589 transitions. [2025-01-09 06:03:00,554 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1589 transitions. Word has length 82 [2025-01-09 06:03:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:00,554 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1589 transitions. [2025-01-09 06:03:00,554 INFO L472 AbstractCegarLoop]: INTERPOLANT 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) [2025-01-09 06:03:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1589 transitions. [2025-01-09 06:03:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 06:03:00,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:00,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:00,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 06:03:00,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 06:03:00,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:00,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash 43617112, now seen corresponding path program 1 times [2025-01-09 06:03:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:00,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542274770] [2025-01-09 06:03:00,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:00,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 06:03:00,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 06:03:00,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:00,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 06:03:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:00,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542274770] [2025-01-09 06:03:00,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542274770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:00,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376213260] [2025-01-09 06:03:00,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:00,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:00,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:00,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:03:00,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 06:03:00,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 06:03:00,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 06:03:00,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:00,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:00,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:03:00,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 06:03:00,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:03:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376213260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:03:00,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:03:00,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512135789] [2025-01-09 06:03:00,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:00,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:00,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:00,980 INFO L87 Difference]: Start difference. First operand 1175 states and 1589 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 06:03:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:01,028 INFO L93 Difference]: Finished difference Result 1586 states and 2110 transitions. [2025-01-09 06:03:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:01,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 96 [2025-01-09 06:03:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:01,034 INFO L225 Difference]: With dead ends: 1586 [2025-01-09 06:03:01,034 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 06:03:01,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 96 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-01-09 06:03:01,036 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 59 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:01,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1162 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 06:03:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-01-09 06:03:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 276 states have (on average 1.576086956521739) internal successors, (435), 278 states have internal predecessors, (435), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 06:03:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 483 transitions. [2025-01-09 06:03:01,047 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 483 transitions. Word has length 96 [2025-01-09 06:03:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 483 transitions. [2025-01-09 06:03:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 06:03:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 483 transitions. [2025-01-09 06:03:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:01,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:01,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:01,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 06:03:01,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:01,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:01,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1275838983, now seen corresponding path program 1 times [2025-01-09 06:03:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226639252] [2025-01-09 06:03:01,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:01,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:01,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:01,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:01,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:01,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226639252] [2025-01-09 06:03:01,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226639252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:01,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:01,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575833099] [2025-01-09 06:03:01,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:01,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:01,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:01,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:01,303 INFO L87 Difference]: Start difference. First operand 308 states and 483 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-09 06:03:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:01,321 INFO L93 Difference]: Finished difference Result 609 states and 957 transitions. [2025-01-09 06:03:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:01,323 INFO L225 Difference]: With dead ends: 609 [2025-01-09 06:03:01,323 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 06:03:01,324 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-01-09 06:03:01,324 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 476 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 482 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-01-09 06:03:01,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 482 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 06:03:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-01-09 06:03:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 276 states have (on average 1.5724637681159421) internal successors, (434), 278 states have internal predecessors, (434), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 06:03:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 482 transitions. [2025-01-09 06:03:01,339 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 482 transitions. Word has length 144 [2025-01-09 06:03:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:01,339 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 482 transitions. [2025-01-09 06:03:01,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-09 06:03:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 482 transitions. [2025-01-09 06:03:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:01,341 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:01,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:01,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:03:01,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:01,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 857950281, now seen corresponding path program 1 times [2025-01-09 06:03:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:01,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014359104] [2025-01-09 06:03:01,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:01,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:01,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:01,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:01,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014359104] [2025-01-09 06:03:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014359104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540122978] [2025-01-09 06:03:01,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:01,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:01,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:01,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:01,394 INFO L87 Difference]: Start difference. First operand 308 states and 482 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-09 06:03:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:01,430 INFO L93 Difference]: Finished difference Result 601 states and 940 transitions. [2025-01-09 06:03:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:01,433 INFO L225 Difference]: With dead ends: 601 [2025-01-09 06:03:01,433 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 06:03:01,433 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-01-09 06:03:01,434 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 467 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 481 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-01-09 06:03:01,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 481 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 06:03:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-01-09 06:03:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 276 states have (on average 1.568840579710145) internal successors, (433), 278 states have internal predecessors, (433), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 06:03:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 481 transitions. [2025-01-09 06:03:01,448 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 481 transitions. Word has length 144 [2025-01-09 06:03:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:01,448 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 481 transitions. [2025-01-09 06:03:01,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-01-09 06:03:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 481 transitions. [2025-01-09 06:03:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:01,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:01,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:01,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:03:01,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:01,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1442721931, now seen corresponding path program 1 times [2025-01-09 06:03:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42345181] [2025-01-09 06:03:01,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:01,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:01,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:01,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:01,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:01,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:01,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42345181] [2025-01-09 06:03:01,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42345181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:01,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:01,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:01,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554689697] [2025-01-09 06:03:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:01,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:01,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:01,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:01,578 INFO L87 Difference]: Start difference. First operand 308 states and 481 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-01-09 06:03:02,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:02,049 INFO L93 Difference]: Finished difference Result 924 states and 1461 transitions. [2025-01-09 06:03:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:03:02,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:02,052 INFO L225 Difference]: With dead ends: 924 [2025-01-09 06:03:02,052 INFO L226 Difference]: Without dead ends: 634 [2025-01-09 06:03:02,053 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-01-09 06:03:02,054 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 907 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:02,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1323 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:03:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-01-09 06:03:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 609. [2025-01-09 06:03:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 552 states have (on average 1.5833333333333333) internal successors, (874), 555 states have internal predecessors, (874), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-01-09 06:03:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 959 transitions. [2025-01-09 06:03:02,076 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 959 transitions. Word has length 144 [2025-01-09 06:03:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:02,077 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 959 transitions. [2025-01-09 06:03:02,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-01-09 06:03:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 959 transitions. [2025-01-09 06:03:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:02,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:02,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:02,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:03:02,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1360400519, now seen corresponding path program 1 times [2025-01-09 06:03:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750250604] [2025-01-09 06:03:02,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:02,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:02,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:02,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:02,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:02,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:02,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750250604] [2025-01-09 06:03:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750250604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:02,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927570958] [2025-01-09 06:03:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:02,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:02,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:02,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:02,215 INFO L87 Difference]: Start difference. First operand 609 states and 959 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:02,794 INFO L93 Difference]: Finished difference Result 1585 states and 2526 transitions. [2025-01-09 06:03:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:02,798 INFO L225 Difference]: With dead ends: 1585 [2025-01-09 06:03:02,798 INFO L226 Difference]: Without dead ends: 994 [2025-01-09 06:03:02,799 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-01-09 06:03:02,800 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 934 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:02,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1876 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:03:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-01-09 06:03:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 889. [2025-01-09 06:03:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 807 states have (on average 1.577447335811648) internal successors, (1273), 811 states have internal predecessors, (1273), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 06:03:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1397 transitions. [2025-01-09 06:03:02,833 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1397 transitions. Word has length 144 [2025-01-09 06:03:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:02,833 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1397 transitions. [2025-01-09 06:03:02,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1397 transitions. [2025-01-09 06:03:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:02,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:02,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:02,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:03:02,835 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:02,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2072733175, now seen corresponding path program 1 times [2025-01-09 06:03:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:02,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292076765] [2025-01-09 06:03:02,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:02,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:02,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:02,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:02,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:02,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:02,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292076765] [2025-01-09 06:03:02,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292076765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:02,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:02,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678932014] [2025-01-09 06:03:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:02,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:02,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:02,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:02,954 INFO L87 Difference]: Start difference. First operand 889 states and 1397 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:03,572 INFO L93 Difference]: Finished difference Result 2477 states and 3943 transitions. [2025-01-09 06:03:03,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:03,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:03,579 INFO L225 Difference]: With dead ends: 2477 [2025-01-09 06:03:03,579 INFO L226 Difference]: Without dead ends: 1606 [2025-01-09 06:03:03,581 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-01-09 06:03:03,582 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 905 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:03,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 2534 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:03:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-09 06:03:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1486. [2025-01-09 06:03:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1352 states have (on average 1.581360946745562) internal successors, (2138), 1360 states have internal predecessors, (2138), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-01-09 06:03:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2346 transitions. [2025-01-09 06:03:03,642 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2346 transitions. Word has length 144 [2025-01-09 06:03:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:03,642 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 2346 transitions. [2025-01-09 06:03:03,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2346 transitions. [2025-01-09 06:03:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:03,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:03,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:03,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:03:03,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:03,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 171825223, now seen corresponding path program 1 times [2025-01-09 06:03:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:03,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815366354] [2025-01-09 06:03:03,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:03,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:03,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:03,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:03,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:03,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815366354] [2025-01-09 06:03:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815366354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:03,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680806732] [2025-01-09 06:03:03,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:03,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:03,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:03,841 INFO L87 Difference]: Start difference. First operand 1486 states and 2346 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:04,670 INFO L93 Difference]: Finished difference Result 4404 states and 7066 transitions. [2025-01-09 06:03:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:04,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:04,685 INFO L225 Difference]: With dead ends: 4404 [2025-01-09 06:03:04,686 INFO L226 Difference]: Without dead ends: 2936 [2025-01-09 06:03:04,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:03:04,691 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 900 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:04,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2522 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:03:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2025-01-09 06:03:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2785. [2025-01-09 06:03:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2541 states have (on average 1.5970090515545061) internal successors, (4058), 2563 states have internal predecessors, (4058), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-01-09 06:03:04,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4458 transitions. [2025-01-09 06:03:04,901 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4458 transitions. Word has length 144 [2025-01-09 06:03:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:04,901 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4458 transitions. [2025-01-09 06:03:04,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4458 transitions. [2025-01-09 06:03:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:04,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:04,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:04,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:03:04,905 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:04,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash 659872329, now seen corresponding path program 1 times [2025-01-09 06:03:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008749272] [2025-01-09 06:03:04,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:04,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:04,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:04,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:04,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:05,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008749272] [2025-01-09 06:03:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008749272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:05,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358530804] [2025-01-09 06:03:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:05,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:05,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:05,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:05,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:05,081 INFO L87 Difference]: Start difference. First operand 2785 states and 4458 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:05,957 INFO L93 Difference]: Finished difference Result 8659 states and 14156 transitions. [2025-01-09 06:03:05,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:05,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:05,988 INFO L225 Difference]: With dead ends: 8659 [2025-01-09 06:03:05,988 INFO L226 Difference]: Without dead ends: 5892 [2025-01-09 06:03:05,997 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-01-09 06:03:05,998 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 895 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:05,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 2510 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:03:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2025-01-09 06:03:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5680. [2025-01-09 06:03:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5198 states have (on average 1.6225471335128896) internal successors, (8434), 5266 states have internal predecessors, (8434), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 06:03:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 9314 transitions. [2025-01-09 06:03:06,322 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 9314 transitions. Word has length 144 [2025-01-09 06:03:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 9314 transitions. [2025-01-09 06:03:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 9314 transitions. [2025-01-09 06:03:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:06,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:06,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:06,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:03:06,328 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:06,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash -432762873, now seen corresponding path program 1 times [2025-01-09 06:03:06,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:06,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878701737] [2025-01-09 06:03:06,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:06,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:06,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:06,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:06,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878701737] [2025-01-09 06:03:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878701737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:06,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:06,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77164097] [2025-01-09 06:03:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:06,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:06,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:06,501 INFO L87 Difference]: Start difference. First operand 5680 states and 9314 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:07,117 INFO L93 Difference]: Finished difference Result 12670 states and 21299 transitions. [2025-01-09 06:03:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:07,164 INFO L225 Difference]: With dead ends: 12670 [2025-01-09 06:03:07,164 INFO L226 Difference]: Without dead ends: 7008 [2025-01-09 06:03:07,186 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-01-09 06:03:07,187 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 642 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:07,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 936 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2025-01-09 06:03:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 5680. [2025-01-09 06:03:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5198 states have (on average 1.619276644863409) internal successors, (8417), 5266 states have internal predecessors, (8417), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 06:03:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 9297 transitions. [2025-01-09 06:03:07,624 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 9297 transitions. Word has length 144 [2025-01-09 06:03:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 9297 transitions. [2025-01-09 06:03:07,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 9297 transitions. [2025-01-09 06:03:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:07,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:07,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:03:07,631 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:07,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1714935159, now seen corresponding path program 1 times [2025-01-09 06:03:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243451813] [2025-01-09 06:03:07,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:07,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:07,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:07,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243451813] [2025-01-09 06:03:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243451813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:07,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:07,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151545723] [2025-01-09 06:03:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:07,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:07,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:07,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:07,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:07,764 INFO L87 Difference]: Start difference. First operand 5680 states and 9297 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:08,457 INFO L93 Difference]: Finished difference Result 12504 states and 20933 transitions. [2025-01-09 06:03:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:08,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:08,516 INFO L225 Difference]: With dead ends: 12504 [2025-01-09 06:03:08,517 INFO L226 Difference]: Without dead ends: 6842 [2025-01-09 06:03:08,538 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-01-09 06:03:08,540 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 638 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:08,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 922 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2025-01-09 06:03:08,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 5680. [2025-01-09 06:03:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5198 states have (on average 1.6160061562139285) internal successors, (8400), 5266 states have internal predecessors, (8400), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 06:03:08,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 9280 transitions. [2025-01-09 06:03:08,969 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 9280 transitions. Word has length 144 [2025-01-09 06:03:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:08,969 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 9280 transitions. [2025-01-09 06:03:08,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 9280 transitions. [2025-01-09 06:03:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:08,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:08,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:08,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:03:08,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:08,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash 858029451, now seen corresponding path program 1 times [2025-01-09 06:03:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:08,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117699143] [2025-01-09 06:03:08,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:08,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:08,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:08,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:08,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117699143] [2025-01-09 06:03:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117699143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045269558] [2025-01-09 06:03:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:09,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:09,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:09,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:09,139 INFO L87 Difference]: Start difference. First operand 5680 states and 9280 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:10,231 INFO L93 Difference]: Finished difference Result 17998 states and 30144 transitions. [2025-01-09 06:03:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:10,292 INFO L225 Difference]: With dead ends: 17998 [2025-01-09 06:03:10,292 INFO L226 Difference]: Without dead ends: 12336 [2025-01-09 06:03:10,318 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-01-09 06:03:10,319 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 871 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:10,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 2446 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:03:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12336 states. [2025-01-09 06:03:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12336 to 12064. [2025-01-09 06:03:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 11052 states have (on average 1.6411509229098806) internal successors, (18138), 11266 states have internal predecessors, (18138), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 06:03:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 20362 transitions. [2025-01-09 06:03:11,149 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 20362 transitions. Word has length 144 [2025-01-09 06:03:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:11,149 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 20362 transitions. [2025-01-09 06:03:11,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 20362 transitions. [2025-01-09 06:03:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:11,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:11,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:11,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:03:11,158 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:11,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash 525386313, now seen corresponding path program 1 times [2025-01-09 06:03:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:11,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023059927] [2025-01-09 06:03:11,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:11,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:11,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:11,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:11,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:11,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:11,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023059927] [2025-01-09 06:03:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023059927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:11,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:11,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967915377] [2025-01-09 06:03:11,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:11,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:11,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:11,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:11,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:11,283 INFO L87 Difference]: Start difference. First operand 12064 states and 20362 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:12,274 INFO L93 Difference]: Finished difference Result 27050 states and 46933 transitions. [2025-01-09 06:03:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:12,340 INFO L225 Difference]: With dead ends: 27050 [2025-01-09 06:03:12,340 INFO L226 Difference]: Without dead ends: 15004 [2025-01-09 06:03:12,377 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-01-09 06:03:12,378 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 655 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:12,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 862 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15004 states. [2025-01-09 06:03:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15004 to 12064. [2025-01-09 06:03:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12064 states, 11052 states have (on average 1.6381650380021715) internal successors, (18105), 11266 states have internal predecessors, (18105), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 06:03:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12064 states to 12064 states and 20329 transitions. [2025-01-09 06:03:13,199 INFO L78 Accepts]: Start accepts. Automaton has 12064 states and 20329 transitions. Word has length 144 [2025-01-09 06:03:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:13,199 INFO L471 AbstractCegarLoop]: Abstraction has 12064 states and 20329 transitions. [2025-01-09 06:03:13,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 12064 states and 20329 transitions. [2025-01-09 06:03:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:13,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:13,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:13,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:03:13,208 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:13,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1840648757, now seen corresponding path program 1 times [2025-01-09 06:03:13,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:13,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903829833] [2025-01-09 06:03:13,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:13,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:13,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:13,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:13,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903829833] [2025-01-09 06:03:13,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903829833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:13,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:13,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:13,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514906409] [2025-01-09 06:03:13,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:13,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:13,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:13,473 INFO L87 Difference]: Start difference. First operand 12064 states and 20329 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:15,272 INFO L93 Difference]: Finished difference Result 41084 states and 71170 transitions. [2025-01-09 06:03:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:15,393 INFO L225 Difference]: With dead ends: 41084 [2025-01-09 06:03:15,393 INFO L226 Difference]: Without dead ends: 29038 [2025-01-09 06:03:15,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:03:15,433 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1142 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:15,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 2402 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:03:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29038 states. [2025-01-09 06:03:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29038 to 26356. [2025-01-09 06:03:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26356 states, 24154 states have (on average 1.665272832657117) internal successors, (40223), 24822 states have internal predecessors, (40223), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-01-09 06:03:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26356 states to 26356 states and 46607 transitions. [2025-01-09 06:03:17,324 INFO L78 Accepts]: Start accepts. Automaton has 26356 states and 46607 transitions. Word has length 144 [2025-01-09 06:03:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:17,325 INFO L471 AbstractCegarLoop]: Abstraction has 26356 states and 46607 transitions. [2025-01-09 06:03:17,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26356 states and 46607 transitions. [2025-01-09 06:03:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:17,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:17,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:17,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:03:17,341 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:17,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash 161237513, now seen corresponding path program 1 times [2025-01-09 06:03:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:17,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618793458] [2025-01-09 06:03:17,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:17,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:17,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:17,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:17,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618793458] [2025-01-09 06:03:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618793458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407655962] [2025-01-09 06:03:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:17,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:17,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:17,456 INFO L87 Difference]: Start difference. First operand 26356 states and 46607 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:21,636 INFO L93 Difference]: Finished difference Result 90526 states and 167054 transitions. [2025-01-09 06:03:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:21,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:22,082 INFO L225 Difference]: With dead ends: 90526 [2025-01-09 06:03:22,083 INFO L226 Difference]: Without dead ends: 64188 [2025-01-09 06:03:22,171 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-01-09 06:03:22,175 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 935 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:22,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 2386 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:03:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64188 states. [2025-01-09 06:03:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64188 to 58885. [2025-01-09 06:03:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58885 states, 53849 states have (on average 1.6908577689464985) internal successors, (91051), 55911 states have internal predecessors, (91051), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-01-09 06:03:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58885 states to 58885 states and 111835 transitions. [2025-01-09 06:03:26,436 INFO L78 Accepts]: Start accepts. Automaton has 58885 states and 111835 transitions. Word has length 144 [2025-01-09 06:03:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:26,437 INFO L471 AbstractCegarLoop]: Abstraction has 58885 states and 111835 transitions. [2025-01-09 06:03:26,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 58885 states and 111835 transitions. [2025-01-09 06:03:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 06:03:26,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:26,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:03:26,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:03:26,454 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:26,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1888382475, now seen corresponding path program 1 times [2025-01-09 06:03:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116617296] [2025-01-09 06:03:26,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:26,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 06:03:26,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 06:03:26,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:26,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116617296] [2025-01-09 06:03:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116617296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700368465] [2025-01-09 06:03:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:26,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:26,573 INFO L87 Difference]: Start difference. First operand 58885 states and 111835 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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-01-09 06:03:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:32,649 INFO L93 Difference]: Finished difference Result 204087 states and 413384 transitions. [2025-01-09 06:03:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:32,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 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 144 [2025-01-09 06:03:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:33,335 INFO L225 Difference]: With dead ends: 204087 [2025-01-09 06:03:33,336 INFO L226 Difference]: Without dead ends: 145220 [2025-01-09 06:03:33,570 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-01-09 06:03:33,571 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1072 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:33,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2378 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:03:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145220 states.