./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:22:23,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:22:23,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:22:23,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:22:23,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:22:23,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:22:23,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:22:23,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:22:23,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:22:23,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:22:23,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:22:23,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:22:23,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:22:23,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:22:23,532 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:22:23,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:23,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:22:23,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce176716d91d866602a372020396224af9fcf4c5f81c6adcdcc0f1d83b0d658f [2025-03-03 16:22:23,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:22:23,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:22:23,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:22:23,799 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:22:23,800 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:22:23,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2025-03-03 16:22:24,986 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc2fcf6c/3a9c55ed10004ee693d58c1b07becbbd/FLAG3e8547e7a [2025-03-03 16:22:25,246 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:22:25,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2025-03-03 16:22:25,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc2fcf6c/3a9c55ed10004ee693d58c1b07becbbd/FLAG3e8547e7a [2025-03-03 16:22:25,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc2fcf6c/3a9c55ed10004ee693d58c1b07becbbd [2025-03-03 16:22:25,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:22:25,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:22:25,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:25,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:22:25,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:22:25,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2cf763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25, skipping insertion in model container [2025-03-03 16:22:25,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:22:25,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2025-03-03 16:22:25,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2025-03-03 16:22:25,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:25,572 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:22:25,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[914,927] [2025-03-03 16:22:25,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-1.c[7115,7128] [2025-03-03 16:22:25,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:25,658 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:22:25,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25 WrapperNode [2025-03-03 16:22:25,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:25,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:25,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:22:25,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:22:25,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,716 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1074 [2025-03-03 16:22:25,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:25,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:22:25,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:22:25,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:22:25,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:22:25,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:22:25,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:22:25,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:22:25,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:22:25,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (1/1) ... [2025-03-03 16:22:25,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:25,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:22:25,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:22:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:22:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:22:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:22:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:22:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:22:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:22:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:22:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:22:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:22:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:22:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:22:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:22:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:22:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:22:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:22:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:22:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:22:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:22:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:22:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:22:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:22:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:22:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-03 16:22:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-03 16:22:25,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:22:25,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:22:26,782 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-03 16:22:26,782 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:22:26,802 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:22:26,806 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:22:26,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:26 BoogieIcfgContainer [2025-03-03 16:22:26,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:22:26,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:22:26,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:22:26,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:22:26,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:22:25" (1/3) ... [2025-03-03 16:22:26,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea09b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:26, skipping insertion in model container [2025-03-03 16:22:26,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:25" (2/3) ... [2025-03-03 16:22:26,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea09b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:26, skipping insertion in model container [2025-03-03 16:22:26,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:26" (3/3) ... [2025-03-03 16:22:26,815 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-1.c [2025-03-03 16:22:26,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:22:26,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.13.cil-1.c that has 16 procedures, 546 locations, 1 initial locations, 20 loop locations, and 2 error locations. [2025-03-03 16:22:26,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:22:26,922 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;@3a78ffcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:22:26,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:22:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 485 states have (on average 1.5670103092783505) internal successors, (760), 493 states have internal predecessors, (760), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-03 16:22:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:26,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:26,935 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] [2025-03-03 16:22:26,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2017189133, now seen corresponding path program 1 times [2025-03-03 16:22:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:26,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728564160] [2025-03-03 16:22:26,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:27,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:27,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:27,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:27,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:27,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:27,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728564160] [2025-03-03 16:22:27,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728564160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:27,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:27,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814371957] [2025-03-03 16:22:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:27,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:27,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:27,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:27,175 INFO L87 Difference]: Start difference. First operand has 546 states, 485 states have (on average 1.5670103092783505) internal successors, (760), 493 states have internal predecessors, (760), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:27,258 INFO L93 Difference]: Finished difference Result 1063 states and 1643 transitions. [2025-03-03 16:22:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:27,272 INFO L225 Difference]: With dead ends: 1063 [2025-03-03 16:22:27,272 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 16:22:27,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:27,279 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 133 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:27,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1497 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 16:22:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-03 16:22:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 477 states have (on average 1.5241090146750524) internal successors, (727), 482 states have internal predecessors, (727), 43 states have call successors, (43), 15 states have call predecessors, (43), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 16:22:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 809 transitions. [2025-03-03 16:22:27,333 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 809 transitions. Word has length 65 [2025-03-03 16:22:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:27,334 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 809 transitions. [2025-03-03 16:22:27,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 809 transitions. [2025-03-03 16:22:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:27,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:27,336 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] [2025-03-03 16:22:27,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:22:27,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:27,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2037526508, now seen corresponding path program 1 times [2025-03-03 16:22:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:27,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516175333] [2025-03-03 16:22:27,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:27,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:27,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:27,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:27,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516175333] [2025-03-03 16:22:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516175333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:27,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431838391] [2025-03-03 16:22:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:27,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:27,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:27,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:27,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:27,554 INFO L87 Difference]: Start difference. First operand 535 states and 809 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:28,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:28,379 INFO L93 Difference]: Finished difference Result 730 states and 1081 transitions. [2025-03-03 16:22:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:28,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:28,389 INFO L225 Difference]: With dead ends: 730 [2025-03-03 16:22:28,389 INFO L226 Difference]: Without dead ends: 640 [2025-03-03 16:22:28,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:28,391 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 497 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:28,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1762 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-03 16:22:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 633. [2025-03-03 16:22:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 555 states have (on average 1.500900900900901) internal successors, (833), 562 states have internal predecessors, (833), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2025-03-03 16:22:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 942 transitions. [2025-03-03 16:22:28,437 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 942 transitions. Word has length 65 [2025-03-03 16:22:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:28,437 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 942 transitions. [2025-03-03 16:22:28,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 942 transitions. [2025-03-03 16:22:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:28,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:28,442 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] [2025-03-03 16:22:28,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:22:28,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:28,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1395657136, now seen corresponding path program 1 times [2025-03-03 16:22:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:28,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812742690] [2025-03-03 16:22:28,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:28,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:28,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:28,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:28,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:28,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:28,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812742690] [2025-03-03 16:22:28,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812742690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:28,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819957149] [2025-03-03 16:22:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:28,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:28,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:28,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:28,648 INFO L87 Difference]: Start difference. First operand 633 states and 942 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:29,464 INFO L93 Difference]: Finished difference Result 956 states and 1378 transitions. [2025-03-03 16:22:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:29,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:29,469 INFO L225 Difference]: With dead ends: 956 [2025-03-03 16:22:29,469 INFO L226 Difference]: Without dead ends: 775 [2025-03-03 16:22:29,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:29,472 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 1179 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:29,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 1968 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-03 16:22:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 731. [2025-03-03 16:22:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 633 states have (on average 1.481832543443918) internal successors, (938), 642 states have internal predecessors, (938), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2025-03-03 16:22:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1077 transitions. [2025-03-03 16:22:29,513 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1077 transitions. Word has length 65 [2025-03-03 16:22:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:29,513 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1077 transitions. [2025-03-03 16:22:29,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1077 transitions. [2025-03-03 16:22:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:29,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:29,517 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] [2025-03-03 16:22:29,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:22:29,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:29,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash -262466543, now seen corresponding path program 1 times [2025-03-03 16:22:29,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640892708] [2025-03-03 16:22:29,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:29,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:29,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:29,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:29,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640892708] [2025-03-03 16:22:29,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640892708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:29,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:29,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240431772] [2025-03-03 16:22:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:29,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:29,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:29,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:29,597 INFO L87 Difference]: Start difference. First operand 731 states and 1077 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:29,650 INFO L93 Difference]: Finished difference Result 1009 states and 1456 transitions. [2025-03-03 16:22:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:29,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 16:22:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:29,655 INFO L225 Difference]: With dead ends: 1009 [2025-03-03 16:22:29,656 INFO L226 Difference]: Without dead ends: 736 [2025-03-03 16:22:29,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:29,658 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 0 mSDsluCounter, 3219 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4025 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:29,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4025 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-03 16:22:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2025-03-03 16:22:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 637 states have (on average 1.4756671899529041) internal successors, (940), 646 states have internal predecessors, (940), 65 states have call successors, (65), 29 states have call predecessors, (65), 32 states have return successors, (75), 64 states have call predecessors, (75), 61 states have call successors, (75) [2025-03-03 16:22:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1080 transitions. [2025-03-03 16:22:29,697 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1080 transitions. Word has length 65 [2025-03-03 16:22:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1080 transitions. [2025-03-03 16:22:29,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1080 transitions. [2025-03-03 16:22:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:29,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:29,699 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] [2025-03-03 16:22:29,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:22:29,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:29,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1370337456, now seen corresponding path program 1 times [2025-03-03 16:22:29,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:29,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126509131] [2025-03-03 16:22:29,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:29,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:29,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:29,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:29,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:29,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:29,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126509131] [2025-03-03 16:22:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126509131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:29,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:22:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558647107] [2025-03-03 16:22:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:29,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:22:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:29,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:22:29,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:22:29,820 INFO L87 Difference]: Start difference. First operand 736 states and 1080 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:31,011 INFO L93 Difference]: Finished difference Result 2004 states and 2801 transitions. [2025-03-03 16:22:31,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:22:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-03-03 16:22:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:31,020 INFO L225 Difference]: With dead ends: 2004 [2025-03-03 16:22:31,020 INFO L226 Difference]: Without dead ends: 1708 [2025-03-03 16:22:31,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:22:31,023 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 3436 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3450 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:31,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3450 Valid, 2144 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:22:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2025-03-03 16:22:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1654. [2025-03-03 16:22:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1369 states have (on average 1.3864134404674946) internal successors, (1898), 1393 states have internal predecessors, (1898), 153 states have call successors, (153), 112 states have call predecessors, (153), 130 states have return successors, (189), 151 states have call predecessors, (189), 149 states have call successors, (189) [2025-03-03 16:22:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2240 transitions. [2025-03-03 16:22:31,083 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2240 transitions. Word has length 65 [2025-03-03 16:22:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:31,084 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2240 transitions. [2025-03-03 16:22:31,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2240 transitions. [2025-03-03 16:22:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:31,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:31,088 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] [2025-03-03 16:22:31,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:22:31,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:31,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1962620150, now seen corresponding path program 1 times [2025-03-03 16:22:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:31,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011324369] [2025-03-03 16:22:31,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:31,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:31,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:31,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011324369] [2025-03-03 16:22:31,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011324369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550056951] [2025-03-03 16:22:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:31,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:31,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:31,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:31,157 INFO L87 Difference]: Start difference. First operand 1654 states and 2240 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:31,225 INFO L93 Difference]: Finished difference Result 2892 states and 3841 transitions. [2025-03-03 16:22:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 16:22:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:31,233 INFO L225 Difference]: With dead ends: 2892 [2025-03-03 16:22:31,234 INFO L226 Difference]: Without dead ends: 1684 [2025-03-03 16:22:31,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:31,238 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 0 mSDsluCounter, 3219 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4025 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:31,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4025 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-03 16:22:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-03 16:22:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1393 states have (on average 1.3740129217516153) internal successors, (1914), 1417 states have internal predecessors, (1914), 153 states have call successors, (153), 112 states have call predecessors, (153), 136 states have return successors, (195), 157 states have call predecessors, (195), 149 states have call successors, (195) [2025-03-03 16:22:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2262 transitions. [2025-03-03 16:22:31,355 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2262 transitions. Word has length 66 [2025-03-03 16:22:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:31,356 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2262 transitions. [2025-03-03 16:22:31,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2262 transitions. [2025-03-03 16:22:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:31,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:31,357 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] [2025-03-03 16:22:31,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:22:31,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1951304023, now seen corresponding path program 1 times [2025-03-03 16:22:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597923695] [2025-03-03 16:22:31,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:31,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:31,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:31,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:31,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:31,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597923695] [2025-03-03 16:22:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597923695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106615264] [2025-03-03 16:22:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:31,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:31,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:31,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:31,466 INFO L87 Difference]: Start difference. First operand 1684 states and 2262 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:32,297 INFO L93 Difference]: Finished difference Result 2916 states and 3778 transitions. [2025-03-03 16:22:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:22:32,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 16:22:32,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:32,307 INFO L225 Difference]: With dead ends: 2916 [2025-03-03 16:22:32,307 INFO L226 Difference]: Without dead ends: 1906 [2025-03-03 16:22:32,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:22:32,310 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1164 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:32,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1746 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-03-03 16:22:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1625. [2025-03-03 16:22:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1350 states have (on average 1.3718518518518519) internal successors, (1852), 1369 states have internal predecessors, (1852), 147 states have call successors, (147), 107 states have call predecessors, (147), 126 states have return successors, (180), 150 states have call predecessors, (180), 143 states have call successors, (180) [2025-03-03 16:22:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 2179 transitions. [2025-03-03 16:22:32,387 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 2179 transitions. Word has length 66 [2025-03-03 16:22:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:32,387 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 2179 transitions. [2025-03-03 16:22:32,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2179 transitions. [2025-03-03 16:22:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:32,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:32,388 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] [2025-03-03 16:22:32,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:22:32,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 266453930, now seen corresponding path program 1 times [2025-03-03 16:22:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914298067] [2025-03-03 16:22:32,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:32,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:32,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:32,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:32,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914298067] [2025-03-03 16:22:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914298067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:32,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:22:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788908173] [2025-03-03 16:22:32,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:32,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:22:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:32,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:22:32,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:22:32,439 INFO L87 Difference]: Start difference. First operand 1625 states and 2179 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:32,973 INFO L93 Difference]: Finished difference Result 3871 states and 5029 transitions. [2025-03-03 16:22:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:22:32,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 16:22:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:32,987 INFO L225 Difference]: With dead ends: 3871 [2025-03-03 16:22:32,988 INFO L226 Difference]: Without dead ends: 2693 [2025-03-03 16:22:32,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:32,992 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1122 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:32,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 895 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-03-03 16:22:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2689. [2025-03-03 16:22:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2174 states have (on average 1.3095676172953081) internal successors, (2847), 2209 states have internal predecessors, (2847), 263 states have call successors, (263), 206 states have call predecessors, (263), 250 states have return successors, (368), 275 states have call predecessors, (368), 259 states have call successors, (368) [2025-03-03 16:22:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 3478 transitions. [2025-03-03 16:22:33,150 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 3478 transitions. Word has length 66 [2025-03-03 16:22:33,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:33,150 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 3478 transitions. [2025-03-03 16:22:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3478 transitions. [2025-03-03 16:22:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:22:33,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:33,151 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] [2025-03-03 16:22:33,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:22:33,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:33,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash -521423224, now seen corresponding path program 1 times [2025-03-03 16:22:33,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:33,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181355826] [2025-03-03 16:22:33,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:33,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:22:33,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:22:33,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:33,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:33,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181355826] [2025-03-03 16:22:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181355826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202503158] [2025-03-03 16:22:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:33,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:33,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:33,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:33,180 INFO L87 Difference]: Start difference. First operand 2689 states and 3478 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:33,321 INFO L93 Difference]: Finished difference Result 5788 states and 7366 transitions. [2025-03-03 16:22:33,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:33,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 16:22:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:33,340 INFO L225 Difference]: With dead ends: 5788 [2025-03-03 16:22:33,340 INFO L226 Difference]: Without dead ends: 3546 [2025-03-03 16:22:33,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:33,347 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 102 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:33,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1600 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2025-03-03 16:22:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 3466. [2025-03-03 16:22:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 2780 states have (on average 1.2920863309352517) internal successors, (3592), 2820 states have internal predecessors, (3592), 347 states have call successors, (347), 279 states have call predecessors, (347), 337 states have return successors, (472), 368 states have call predecessors, (472), 343 states have call successors, (472) [2025-03-03 16:22:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 4411 transitions. [2025-03-03 16:22:33,542 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 4411 transitions. Word has length 67 [2025-03-03 16:22:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:33,542 INFO L471 AbstractCegarLoop]: Abstraction has 3466 states and 4411 transitions. [2025-03-03 16:22:33,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 4411 transitions. [2025-03-03 16:22:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:22:33,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:33,544 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] [2025-03-03 16:22:33,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:22:33,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:33,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1049204132, now seen corresponding path program 1 times [2025-03-03 16:22:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027642346] [2025-03-03 16:22:33,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:33,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:22:33,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:22:33,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:33,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027642346] [2025-03-03 16:22:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027642346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:33,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:33,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809793013] [2025-03-03 16:22:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:33,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:33,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:33,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:33,592 INFO L87 Difference]: Start difference. First operand 3466 states and 4411 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:33,737 INFO L93 Difference]: Finished difference Result 6825 states and 8546 transitions. [2025-03-03 16:22:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-03 16:22:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:33,755 INFO L225 Difference]: With dead ends: 6825 [2025-03-03 16:22:33,756 INFO L226 Difference]: Without dead ends: 3805 [2025-03-03 16:22:33,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:33,764 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 773 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:33,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 942 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2025-03-03 16:22:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3744. [2025-03-03 16:22:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3001 states have (on average 1.2849050316561146) internal successors, (3856), 3043 states have internal predecessors, (3856), 375 states have call successors, (375), 304 states have call predecessors, (375), 366 states have return successors, (504), 398 states have call predecessors, (504), 371 states have call successors, (504) [2025-03-03 16:22:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 4735 transitions. [2025-03-03 16:22:33,957 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 4735 transitions. Word has length 73 [2025-03-03 16:22:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:33,958 INFO L471 AbstractCegarLoop]: Abstraction has 3744 states and 4735 transitions. [2025-03-03 16:22:33,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 4735 transitions. [2025-03-03 16:22:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:22:33,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:33,959 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:22:33,959 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:33,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -370917599, now seen corresponding path program 1 times [2025-03-03 16:22:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754688540] [2025-03-03 16:22:33,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:33,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:22:33,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:22:33,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:33,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:34,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:34,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754688540] [2025-03-03 16:22:34,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754688540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:34,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:22:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096868385] [2025-03-03 16:22:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:34,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:22:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:34,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:22:34,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:22:34,041 INFO L87 Difference]: Start difference. First operand 3744 states and 4735 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:34,473 INFO L93 Difference]: Finished difference Result 4543 states and 5703 transitions. [2025-03-03 16:22:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2025-03-03 16:22:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:34,493 INFO L225 Difference]: With dead ends: 4543 [2025-03-03 16:22:34,493 INFO L226 Difference]: Without dead ends: 4540 [2025-03-03 16:22:34,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:34,496 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 1501 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:34,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 925 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:22:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2025-03-03 16:22:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4206. [2025-03-03 16:22:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 3356 states have (on average 1.2738379022646007) internal successors, (4275), 3401 states have internal predecessors, (4275), 425 states have call successors, (425), 348 states have call predecessors, (425), 423 states have return successors, (581), 458 states have call predecessors, (581), 422 states have call successors, (581) [2025-03-03 16:22:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 5281 transitions. [2025-03-03 16:22:34,773 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 5281 transitions. Word has length 75 [2025-03-03 16:22:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:34,774 INFO L471 AbstractCegarLoop]: Abstraction has 4206 states and 5281 transitions. [2025-03-03 16:22:34,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 5281 transitions. [2025-03-03 16:22:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:22:34,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:34,775 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:34,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:22:34,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:34,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1385790399, now seen corresponding path program 1 times [2025-03-03 16:22:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500966589] [2025-03-03 16:22:34,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:34,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:22:34,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:22:34,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500966589] [2025-03-03 16:22:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500966589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2945236] [2025-03-03 16:22:34,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:34,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:22:34,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:22:34,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:22:34,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:22:34,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:34,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:34,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:22:34,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:35,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:22:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2945236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:22:35,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:22:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-03 16:22:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468935610] [2025-03-03 16:22:35,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:22:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:22:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:35,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:22:35,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:35,305 INFO L87 Difference]: Start difference. First operand 4206 states and 5281 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:22:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:35,890 INFO L93 Difference]: Finished difference Result 8057 states and 9958 transitions. [2025-03-03 16:22:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:22:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 76 [2025-03-03 16:22:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:35,929 INFO L225 Difference]: With dead ends: 8057 [2025-03-03 16:22:35,929 INFO L226 Difference]: Without dead ends: 8054 [2025-03-03 16:22:35,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:35,934 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 1737 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:35,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 3686 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8054 states. [2025-03-03 16:22:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8054 to 7649. [2025-03-03 16:22:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 6057 states have (on average 1.2521050024764735) internal successors, (7584), 6137 states have internal predecessors, (7584), 784 states have call successors, (784), 662 states have call predecessors, (784), 806 states have return successors, (1082), 851 states have call predecessors, (1082), 781 states have call successors, (1082) [2025-03-03 16:22:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 9450 transitions. [2025-03-03 16:22:36,359 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 9450 transitions. Word has length 76 [2025-03-03 16:22:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:36,361 INFO L471 AbstractCegarLoop]: Abstraction has 7649 states and 9450 transitions. [2025-03-03 16:22:36,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:22:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 9450 transitions. [2025-03-03 16:22:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:22:36,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:36,363 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:36,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:22:36,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 16:22:36,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:36,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 537767295, now seen corresponding path program 2 times [2025-03-03 16:22:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:36,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712962514] [2025-03-03 16:22:36,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:22:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:36,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-03 16:22:36,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:22:36,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 16:22:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:36,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712962514] [2025-03-03 16:22:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712962514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:36,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:36,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905777999] [2025-03-03 16:22:36,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:36,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:36,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:36,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:36,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:36,603 INFO L87 Difference]: Start difference. First operand 7649 states and 9450 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:36,893 INFO L93 Difference]: Finished difference Result 10074 states and 12473 transitions. [2025-03-03 16:22:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:36,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2025-03-03 16:22:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:36,918 INFO L225 Difference]: With dead ends: 10074 [2025-03-03 16:22:36,919 INFO L226 Difference]: Without dead ends: 3850 [2025-03-03 16:22:36,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:36,937 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 778 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:36,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 996 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2025-03-03 16:22:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3047. [2025-03-03 16:22:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 2459 states have (on average 1.2712484749898332) internal successors, (3126), 2485 states have internal predecessors, (3126), 304 states have call successors, (304), 245 states have call predecessors, (304), 282 states have return successors, (383), 318 states have call predecessors, (383), 301 states have call successors, (383) [2025-03-03 16:22:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 3813 transitions. [2025-03-03 16:22:37,134 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 3813 transitions. Word has length 79 [2025-03-03 16:22:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:37,135 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 3813 transitions. [2025-03-03 16:22:37,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 3813 transitions. [2025-03-03 16:22:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 16:22:37,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:37,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:37,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:22:37,138 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash -594381010, now seen corresponding path program 1 times [2025-03-03 16:22:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:37,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960674042] [2025-03-03 16:22:37,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:37,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:37,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 16:22:37,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 16:22:37,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:22:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960674042] [2025-03-03 16:22:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960674042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:37,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:37,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:37,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7965999] [2025-03-03 16:22:37,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:37,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:37,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:37,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:37,241 INFO L87 Difference]: Start difference. First operand 3047 states and 3813 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:38,468 INFO L93 Difference]: Finished difference Result 8228 states and 10073 transitions. [2025-03-03 16:22:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:22:38,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2025-03-03 16:22:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:38,484 INFO L225 Difference]: With dead ends: 8228 [2025-03-03 16:22:38,484 INFO L226 Difference]: Without dead ends: 4904 [2025-03-03 16:22:38,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:22:38,491 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 881 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:38,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2241 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:22:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2025-03-03 16:22:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4712. [2025-03-03 16:22:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 3741 states have (on average 1.2333600641539695) internal successors, (4614), 3798 states have internal predecessors, (4614), 485 states have call successors, (485), 404 states have call predecessors, (485), 484 states have return successors, (676), 511 states have call predecessors, (676), 482 states have call successors, (676) [2025-03-03 16:22:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 5775 transitions. [2025-03-03 16:22:38,745 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 5775 transitions. Word has length 85 [2025-03-03 16:22:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:38,745 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 5775 transitions. [2025-03-03 16:22:38,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 5775 transitions. [2025-03-03 16:22:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:22:38,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:38,748 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:38,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:22:38,749 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash 510569649, now seen corresponding path program 1 times [2025-03-03 16:22:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:38,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293937625] [2025-03-03 16:22:38,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:38,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:22:38,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:22:38,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:38,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:22:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293937625] [2025-03-03 16:22:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293937625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:22:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740306611] [2025-03-03 16:22:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:38,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:22:38,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:38,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:22:38,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:38,836 INFO L87 Difference]: Start difference. First operand 4712 states and 5775 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:39,920 INFO L93 Difference]: Finished difference Result 7574 states and 9240 transitions. [2025-03-03 16:22:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:22:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-03 16:22:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:39,935 INFO L225 Difference]: With dead ends: 7574 [2025-03-03 16:22:39,936 INFO L226 Difference]: Without dead ends: 3833 [2025-03-03 16:22:39,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:22:39,944 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 1780 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:39,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 2326 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:22:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2025-03-03 16:22:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3493. [2025-03-03 16:22:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3493 states, 2780 states have (on average 1.2323741007194244) internal successors, (3426), 2824 states have internal predecessors, (3426), 354 states have call successors, (354), 287 states have call predecessors, (354), 357 states have return successors, (471), 383 states have call predecessors, (471), 351 states have call successors, (471) [2025-03-03 16:22:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 4251 transitions. [2025-03-03 16:22:40,148 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 4251 transitions. Word has length 95 [2025-03-03 16:22:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:40,149 INFO L471 AbstractCegarLoop]: Abstraction has 3493 states and 4251 transitions. [2025-03-03 16:22:40,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 4251 transitions. [2025-03-03 16:22:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 16:22:40,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:40,152 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:40,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:22:40,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:40,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1057947500, now seen corresponding path program 1 times [2025-03-03 16:22:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531346377] [2025-03-03 16:22:40,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:40,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 16:22:40,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 16:22:40,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:40,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 16:22:40,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531346377] [2025-03-03 16:22:40,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531346377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869290277] [2025-03-03 16:22:40,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:40,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:40,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:40,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:22:40,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:22:40,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 16:22:40,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 16:22:40,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:40,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:40,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 16:22:40,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 16:22:40,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:22:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869290277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:40,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:22:40,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 16:22:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215093532] [2025-03-03 16:22:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:40,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:40,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:40,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:40,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:40,445 INFO L87 Difference]: Start difference. First operand 3493 states and 4251 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:22:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:40,531 INFO L93 Difference]: Finished difference Result 4931 states and 5957 transitions. [2025-03-03 16:22:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-03-03 16:22:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:40,539 INFO L225 Difference]: With dead ends: 4931 [2025-03-03 16:22:40,540 INFO L226 Difference]: Without dead ends: 1885 [2025-03-03 16:22:40,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:40,545 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 0 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4006 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:40,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4006 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2025-03-03 16:22:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1885. [2025-03-03 16:22:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1581 states have (on average 1.2681846932321315) internal successors, (2005), 1596 states have internal predecessors, (2005), 157 states have call successors, (157), 111 states have call predecessors, (157), 145 states have return successors, (208), 178 states have call predecessors, (208), 154 states have call successors, (208) [2025-03-03 16:22:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2370 transitions. [2025-03-03 16:22:40,653 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2370 transitions. Word has length 146 [2025-03-03 16:22:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:40,654 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2370 transitions. [2025-03-03 16:22:40,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:22:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2370 transitions. [2025-03-03 16:22:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 16:22:40,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:40,656 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:40,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:22:40,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 16:22:40,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:40,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1513797346, now seen corresponding path program 1 times [2025-03-03 16:22:40,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:40,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259404786] [2025-03-03 16:22:40,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:40,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 16:22:40,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 16:22:40,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:40,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 16:22:40,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259404786] [2025-03-03 16:22:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259404786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:40,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566815143] [2025-03-03 16:22:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:40,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:40,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:40,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:40,936 INFO L87 Difference]: Start difference. First operand 1885 states and 2370 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 16:22:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:41,683 INFO L93 Difference]: Finished difference Result 3164 states and 3881 transitions. [2025-03-03 16:22:41,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:41,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 161 [2025-03-03 16:22:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:41,690 INFO L225 Difference]: With dead ends: 3164 [2025-03-03 16:22:41,690 INFO L226 Difference]: Without dead ends: 1823 [2025-03-03 16:22:41,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:41,693 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 386 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:41,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1741 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2025-03-03 16:22:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1738. [2025-03-03 16:22:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1462 states have (on average 1.2818057455540355) internal successors, (1874), 1476 states have internal predecessors, (1874), 143 states have call successors, (143), 99 states have call predecessors, (143), 131 states have return successors, (188), 163 states have call predecessors, (188), 140 states have call successors, (188) [2025-03-03 16:22:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2205 transitions. [2025-03-03 16:22:41,766 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2205 transitions. Word has length 161 [2025-03-03 16:22:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2205 transitions. [2025-03-03 16:22:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 16:22:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2205 transitions. [2025-03-03 16:22:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:22:41,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:41,769 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:41,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:22:41,769 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:41,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash 237632117, now seen corresponding path program 1 times [2025-03-03 16:22:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:41,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649484547] [2025-03-03 16:22:41,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:41,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:41,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:22:41,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:22:41,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:41,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 16:22:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649484547] [2025-03-03 16:22:41,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649484547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181281004] [2025-03-03 16:22:41,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:41,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:41,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:41,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:22:41,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:22:42,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:22:42,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:22:42,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:42,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:42,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 16:22:42,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 16:22:42,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:22:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 16:22:42,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181281004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:22:42,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:22:42,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-03 16:22:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478410404] [2025-03-03 16:22:42,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:22:42,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 16:22:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:42,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 16:22:42,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:42,392 INFO L87 Difference]: Start difference. First operand 1738 states and 2205 transitions. Second operand has 13 states, 13 states have (on average 19.23076923076923) internal successors, (250), 13 states have internal predecessors, (250), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-03 16:22:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:43,636 INFO L93 Difference]: Finished difference Result 3579 states and 4470 transitions. [2025-03-03 16:22:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 16:22:43,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 19.23076923076923) internal successors, (250), 13 states have internal predecessors, (250), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 164 [2025-03-03 16:22:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:43,644 INFO L225 Difference]: With dead ends: 3579 [2025-03-03 16:22:43,645 INFO L226 Difference]: Without dead ends: 2220 [2025-03-03 16:22:43,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-03-03 16:22:43,649 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1822 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:43,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 2760 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:22:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2025-03-03 16:22:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2016. [2025-03-03 16:22:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1665 states have (on average 1.2474474474474475) internal successors, (2077), 1680 states have internal predecessors, (2077), 183 states have call successors, (183), 137 states have call predecessors, (183), 166 states have return successors, (257), 199 states have call predecessors, (257), 180 states have call successors, (257) [2025-03-03 16:22:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2517 transitions. [2025-03-03 16:22:43,750 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2517 transitions. Word has length 164 [2025-03-03 16:22:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:43,751 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 2517 transitions. [2025-03-03 16:22:43,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.23076923076923) internal successors, (250), 13 states have internal predecessors, (250), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-03 16:22:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2517 transitions. [2025-03-03 16:22:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:43,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:43,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:43,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:22:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 16:22:43,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:43,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2060286805, now seen corresponding path program 1 times [2025-03-03 16:22:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:43,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411367053] [2025-03-03 16:22:43,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:43,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:43,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:43,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:43,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:43,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:44,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411367053] [2025-03-03 16:22:44,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411367053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:44,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:44,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:44,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779505120] [2025-03-03 16:22:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:44,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:44,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:44,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:44,031 INFO L87 Difference]: Start difference. First operand 2016 states and 2517 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:44,110 INFO L93 Difference]: Finished difference Result 2440 states and 3171 transitions. [2025-03-03 16:22:44,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:44,118 INFO L225 Difference]: With dead ends: 2440 [2025-03-03 16:22:44,118 INFO L226 Difference]: Without dead ends: 2016 [2025-03-03 16:22:44,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:44,120 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 663 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:44,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 934 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2025-03-03 16:22:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 2016. [2025-03-03 16:22:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1665 states have (on average 1.2468468468468468) internal successors, (2076), 1680 states have internal predecessors, (2076), 183 states have call successors, (183), 137 states have call predecessors, (183), 166 states have return successors, (257), 199 states have call predecessors, (257), 180 states have call successors, (257) [2025-03-03 16:22:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2516 transitions. [2025-03-03 16:22:44,217 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2516 transitions. Word has length 190 [2025-03-03 16:22:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:44,217 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 2516 transitions. [2025-03-03 16:22:44,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2516 transitions. [2025-03-03 16:22:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:44,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:44,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:44,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:22:44,221 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:44,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:44,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2070057366, now seen corresponding path program 1 times [2025-03-03 16:22:44,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:44,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723980855] [2025-03-03 16:22:44,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:44,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:44,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:44,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:44,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:44,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:44,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:44,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723980855] [2025-03-03 16:22:44,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723980855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:44,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:44,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:44,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147844270] [2025-03-03 16:22:44,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:44,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:44,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:44,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:44,315 INFO L87 Difference]: Start difference. First operand 2016 states and 2516 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:44,975 INFO L93 Difference]: Finished difference Result 2900 states and 3900 transitions. [2025-03-03 16:22:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:44,982 INFO L225 Difference]: With dead ends: 2900 [2025-03-03 16:22:44,982 INFO L226 Difference]: Without dead ends: 2484 [2025-03-03 16:22:44,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:44,984 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1444 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:44,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2080 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2025-03-03 16:22:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2451. [2025-03-03 16:22:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2071 states have (on average 1.3090294543698697) internal successors, (2711), 2087 states have internal predecessors, (2711), 205 states have call successors, (205), 143 states have call predecessors, (205), 173 states have return successors, (280), 221 states have call predecessors, (280), 202 states have call successors, (280) [2025-03-03 16:22:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3196 transitions. [2025-03-03 16:22:45,089 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3196 transitions. Word has length 190 [2025-03-03 16:22:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:45,090 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 3196 transitions. [2025-03-03 16:22:45,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3196 transitions. [2025-03-03 16:22:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:45,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:45,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:45,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:22:45,093 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:45,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash -846086936, now seen corresponding path program 1 times [2025-03-03 16:22:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484033558] [2025-03-03 16:22:45,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:45,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:45,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:45,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484033558] [2025-03-03 16:22:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484033558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466951421] [2025-03-03 16:22:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:45,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:45,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:45,219 INFO L87 Difference]: Start difference. First operand 2451 states and 3196 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:46,036 INFO L93 Difference]: Finished difference Result 3853 states and 5417 transitions. [2025-03-03 16:22:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:46,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:46,050 INFO L225 Difference]: With dead ends: 3853 [2025-03-03 16:22:46,050 INFO L226 Difference]: Without dead ends: 3002 [2025-03-03 16:22:46,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:46,053 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 1455 mSDsluCounter, 2987 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 3963 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:46,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 3963 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2025-03-03 16:22:46,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2857. [2025-03-03 16:22:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2448 states have (on average 1.3431372549019607) internal successors, (3288), 2465 states have internal predecessors, (3288), 227 states have call successors, (227), 149 states have call predecessors, (227), 180 states have return successors, (305), 244 states have call predecessors, (305), 224 states have call successors, (305) [2025-03-03 16:22:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3820 transitions. [2025-03-03 16:22:46,190 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3820 transitions. Word has length 190 [2025-03-03 16:22:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:46,190 INFO L471 AbstractCegarLoop]: Abstraction has 2857 states and 3820 transitions. [2025-03-03 16:22:46,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3820 transitions. [2025-03-03 16:22:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:46,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:46,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:46,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:22:46,194 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1807712151, now seen corresponding path program 1 times [2025-03-03 16:22:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:46,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659405613] [2025-03-03 16:22:46,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:46,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:46,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:46,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659405613] [2025-03-03 16:22:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659405613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:46,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020548738] [2025-03-03 16:22:46,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:46,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:46,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:46,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:46,305 INFO L87 Difference]: Start difference. First operand 2857 states and 3820 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:47,062 INFO L93 Difference]: Finished difference Result 5147 states and 7440 transitions. [2025-03-03 16:22:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:47,074 INFO L225 Difference]: With dead ends: 5147 [2025-03-03 16:22:47,074 INFO L226 Difference]: Without dead ends: 3890 [2025-03-03 16:22:47,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:47,078 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 1450 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:47,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 3947 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2025-03-03 16:22:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3722. [2025-03-03 16:22:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3253 states have (on average 1.39594220719336) internal successors, (4541), 3274 states have internal predecessors, (4541), 271 states have call successors, (271), 161 states have call predecessors, (271), 196 states have return successors, (361), 290 states have call predecessors, (361), 268 states have call successors, (361) [2025-03-03 16:22:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5173 transitions. [2025-03-03 16:22:47,270 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5173 transitions. Word has length 190 [2025-03-03 16:22:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:47,270 INFO L471 AbstractCegarLoop]: Abstraction has 3722 states and 5173 transitions. [2025-03-03 16:22:47,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5173 transitions. [2025-03-03 16:22:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:47,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:47,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:22:47,274 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:47,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1624950984, now seen corresponding path program 1 times [2025-03-03 16:22:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891117874] [2025-03-03 16:22:47,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:47,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:47,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:47,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:47,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:47,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891117874] [2025-03-03 16:22:47,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891117874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:47,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:47,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661728183] [2025-03-03 16:22:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:47,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:47,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:47,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:47,382 INFO L87 Difference]: Start difference. First operand 3722 states and 5173 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:48,254 INFO L93 Difference]: Finished difference Result 7942 states and 11903 transitions. [2025-03-03 16:22:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:48,268 INFO L225 Difference]: With dead ends: 7942 [2025-03-03 16:22:48,268 INFO L226 Difference]: Without dead ends: 5820 [2025-03-03 16:22:48,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:48,276 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 1445 mSDsluCounter, 2966 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:48,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 3935 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5820 states. [2025-03-03 16:22:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5820 to 5605. [2025-03-03 16:22:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5605 states, 5010 states have (on average 1.4636726546906187) internal successors, (7333), 5045 states have internal predecessors, (7333), 359 states have call successors, (359), 185 states have call predecessors, (359), 234 states have return successors, (497), 382 states have call predecessors, (497), 356 states have call successors, (497) [2025-03-03 16:22:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5605 states to 5605 states and 8189 transitions. [2025-03-03 16:22:48,649 INFO L78 Accepts]: Start accepts. Automaton has 5605 states and 8189 transitions. Word has length 190 [2025-03-03 16:22:48,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:48,649 INFO L471 AbstractCegarLoop]: Abstraction has 5605 states and 8189 transitions. [2025-03-03 16:22:48,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5605 states and 8189 transitions. [2025-03-03 16:22:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:48,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:48,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:48,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:22:48,653 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:48,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1874229385, now seen corresponding path program 1 times [2025-03-03 16:22:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436843028] [2025-03-03 16:22:48,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:48,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:48,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:48,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:48,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:48,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436843028] [2025-03-03 16:22:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436843028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81677326] [2025-03-03 16:22:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:48,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:48,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:48,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:48,749 INFO L87 Difference]: Start difference. First operand 5605 states and 8189 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:49,655 INFO L93 Difference]: Finished difference Result 14125 states and 22057 transitions. [2025-03-03 16:22:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:49,679 INFO L225 Difference]: With dead ends: 14125 [2025-03-03 16:22:49,679 INFO L226 Difference]: Without dead ends: 10120 [2025-03-03 16:22:49,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:49,688 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 1440 mSDsluCounter, 2957 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:49,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 3923 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10120 states. [2025-03-03 16:22:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10120 to 9812. [2025-03-03 16:22:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9812 states, 8947 states have (on average 1.5358220632614283) internal successors, (13741), 9028 states have internal predecessors, (13741), 535 states have call successors, (535), 233 states have call predecessors, (535), 328 states have return successors, (865), 566 states have call predecessors, (865), 532 states have call successors, (865) [2025-03-03 16:22:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9812 states to 9812 states and 15141 transitions. [2025-03-03 16:22:50,025 INFO L78 Accepts]: Start accepts. Automaton has 9812 states and 15141 transitions. Word has length 190 [2025-03-03 16:22:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:50,025 INFO L471 AbstractCegarLoop]: Abstraction has 9812 states and 15141 transitions. [2025-03-03 16:22:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9812 states and 15141 transitions. [2025-03-03 16:22:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:50,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:50,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:22:50,030 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2135602008, now seen corresponding path program 1 times [2025-03-03 16:22:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:50,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860545912] [2025-03-03 16:22:50,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:50,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:50,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:50,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:50,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:50,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860545912] [2025-03-03 16:22:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860545912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:50,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:50,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429282675] [2025-03-03 16:22:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:50,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:50,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:50,108 INFO L87 Difference]: Start difference. First operand 9812 states and 15141 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:50,831 INFO L93 Difference]: Finished difference Result 20016 states and 32432 transitions. [2025-03-03 16:22:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:50,867 INFO L225 Difference]: With dead ends: 20016 [2025-03-03 16:22:50,868 INFO L226 Difference]: Without dead ends: 11804 [2025-03-03 16:22:50,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:50,888 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 1075 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:50,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1543 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11804 states. [2025-03-03 16:22:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11804 to 9812. [2025-03-03 16:22:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9812 states, 8947 states have (on average 1.5339219850229127) internal successors, (13724), 9028 states have internal predecessors, (13724), 535 states have call successors, (535), 233 states have call predecessors, (535), 328 states have return successors, (865), 566 states have call predecessors, (865), 532 states have call successors, (865) [2025-03-03 16:22:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9812 states to 9812 states and 15124 transitions. [2025-03-03 16:22:51,290 INFO L78 Accepts]: Start accepts. Automaton has 9812 states and 15124 transitions. Word has length 190 [2025-03-03 16:22:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:51,291 INFO L471 AbstractCegarLoop]: Abstraction has 9812 states and 15124 transitions. [2025-03-03 16:22:51,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 9812 states and 15124 transitions. [2025-03-03 16:22:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:51,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:51,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:51,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:22:51,295 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:51,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1433667415, now seen corresponding path program 1 times [2025-03-03 16:22:51,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:51,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128339250] [2025-03-03 16:22:51,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:51,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:51,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:51,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:51,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:51,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128339250] [2025-03-03 16:22:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128339250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172666804] [2025-03-03 16:22:51,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:51,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:51,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:51,370 INFO L87 Difference]: Start difference. First operand 9812 states and 15124 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:52,202 INFO L93 Difference]: Finished difference Result 19933 states and 32232 transitions. [2025-03-03 16:22:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:52,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:52,235 INFO L225 Difference]: With dead ends: 19933 [2025-03-03 16:22:52,235 INFO L226 Difference]: Without dead ends: 11721 [2025-03-03 16:22:52,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:52,248 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 1072 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:52,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1535 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11721 states. [2025-03-03 16:22:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11721 to 9812. [2025-03-03 16:22:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9812 states, 8947 states have (on average 1.532021906784397) internal successors, (13707), 9028 states have internal predecessors, (13707), 535 states have call successors, (535), 233 states have call predecessors, (535), 328 states have return successors, (865), 566 states have call predecessors, (865), 532 states have call successors, (865) [2025-03-03 16:22:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9812 states to 9812 states and 15107 transitions. [2025-03-03 16:22:52,840 INFO L78 Accepts]: Start accepts. Automaton has 9812 states and 15107 transitions. Word has length 190 [2025-03-03 16:22:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:52,840 INFO L471 AbstractCegarLoop]: Abstraction has 9812 states and 15107 transitions. [2025-03-03 16:22:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9812 states and 15107 transitions. [2025-03-03 16:22:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:52,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:52,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:52,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 16:22:52,844 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:52,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:52,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1826666360, now seen corresponding path program 1 times [2025-03-03 16:22:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:52,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105845263] [2025-03-03 16:22:52,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:52,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:52,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:52,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:52,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:52,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105845263] [2025-03-03 16:22:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105845263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465544137] [2025-03-03 16:22:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:52,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:52,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:52,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:52,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:52,916 INFO L87 Difference]: Start difference. First operand 9812 states and 15107 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:53,563 INFO L93 Difference]: Finished difference Result 19850 states and 32032 transitions. [2025-03-03 16:22:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:53,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:53,590 INFO L225 Difference]: With dead ends: 19850 [2025-03-03 16:22:53,590 INFO L226 Difference]: Without dead ends: 11638 [2025-03-03 16:22:53,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:53,601 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1069 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:53,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1527 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11638 states. [2025-03-03 16:22:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11638 to 9812. [2025-03-03 16:22:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9812 states, 8947 states have (on average 1.5301218285458813) internal successors, (13690), 9028 states have internal predecessors, (13690), 535 states have call successors, (535), 233 states have call predecessors, (535), 328 states have return successors, (865), 566 states have call predecessors, (865), 532 states have call successors, (865) [2025-03-03 16:22:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9812 states to 9812 states and 15090 transitions. [2025-03-03 16:22:53,958 INFO L78 Accepts]: Start accepts. Automaton has 9812 states and 15090 transitions. Word has length 190 [2025-03-03 16:22:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:53,958 INFO L471 AbstractCegarLoop]: Abstraction has 9812 states and 15090 transitions. [2025-03-03 16:22:53,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 9812 states and 15090 transitions. [2025-03-03 16:22:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:53,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:53,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:53,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 16:22:53,961 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:53,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash 654508233, now seen corresponding path program 1 times [2025-03-03 16:22:53,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:53,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758091816] [2025-03-03 16:22:53,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:53,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:53,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:53,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:53,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758091816] [2025-03-03 16:22:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758091816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520420583] [2025-03-03 16:22:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:54,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:54,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:54,057 INFO L87 Difference]: Start difference. First operand 9812 states and 15090 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:55,309 INFO L93 Difference]: Finished difference Result 27896 states and 45274 transitions. [2025-03-03 16:22:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:55,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:55,355 INFO L225 Difference]: With dead ends: 27896 [2025-03-03 16:22:55,356 INFO L226 Difference]: Without dead ends: 19684 [2025-03-03 16:22:55,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:55,378 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 1411 mSDsluCounter, 2906 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:55,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 3854 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19684 states. [2025-03-03 16:22:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19684 to 19252. [2025-03-03 16:22:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19252 states, 17793 states have (on average 1.5927611982240206) internal successors, (28340), 18020 states have internal predecessors, (28340), 887 states have call successors, (887), 329 states have call predecessors, (887), 570 states have return successors, (1985), 934 states have call predecessors, (1985), 884 states have call successors, (1985) [2025-03-03 16:22:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19252 states to 19252 states and 31212 transitions. [2025-03-03 16:22:56,041 INFO L78 Accepts]: Start accepts. Automaton has 19252 states and 31212 transitions. Word has length 190 [2025-03-03 16:22:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:56,041 INFO L471 AbstractCegarLoop]: Abstraction has 19252 states and 31212 transitions. [2025-03-03 16:22:56,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 19252 states and 31212 transitions. [2025-03-03 16:22:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:56,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:56,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:56,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 16:22:56,046 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:56,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:56,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1704377448, now seen corresponding path program 1 times [2025-03-03 16:22:56,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:56,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363285658] [2025-03-03 16:22:56,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:56,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:56,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:56,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:56,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:56,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363285658] [2025-03-03 16:22:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363285658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:56,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:56,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672598143] [2025-03-03 16:22:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:56,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:56,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:56,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:56,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:56,123 INFO L87 Difference]: Start difference. First operand 19252 states and 31212 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:57,422 INFO L93 Difference]: Finished difference Result 41804 states and 70704 transitions. [2025-03-03 16:22:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:22:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:57,484 INFO L225 Difference]: With dead ends: 41804 [2025-03-03 16:22:57,484 INFO L226 Difference]: Without dead ends: 24152 [2025-03-03 16:22:57,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:57,521 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1065 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:57,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 1513 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24152 states. [2025-03-03 16:22:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24152 to 19252. [2025-03-03 16:22:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19252 states, 17793 states have (on average 1.5909065362783117) internal successors, (28307), 18020 states have internal predecessors, (28307), 887 states have call successors, (887), 329 states have call predecessors, (887), 570 states have return successors, (1985), 934 states have call predecessors, (1985), 884 states have call successors, (1985) [2025-03-03 16:22:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19252 states to 19252 states and 31179 transitions. [2025-03-03 16:22:58,325 INFO L78 Accepts]: Start accepts. Automaton has 19252 states and 31179 transitions. Word has length 190 [2025-03-03 16:22:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:58,325 INFO L471 AbstractCegarLoop]: Abstraction has 19252 states and 31179 transitions. [2025-03-03 16:22:58,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 19252 states and 31179 transitions. [2025-03-03 16:22:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:22:58,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:58,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 16:22:58,331 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:58,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1876791529, now seen corresponding path program 1 times [2025-03-03 16:22:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:58,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826997785] [2025-03-03 16:22:58,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:58,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:22:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:22:58,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:58,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:58,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826997785] [2025-03-03 16:22:58,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826997785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:58,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:58,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542176233] [2025-03-03 16:22:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:58,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:58,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:58,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:58,418 INFO L87 Difference]: Start difference. First operand 19252 states and 31179 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:00,060 INFO L93 Difference]: Finished difference Result 59398 states and 100939 transitions. [2025-03-03 16:23:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:23:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:00,183 INFO L225 Difference]: With dead ends: 59398 [2025-03-03 16:23:00,183 INFO L226 Difference]: Without dead ends: 41746 [2025-03-03 16:23:00,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:00,230 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1398 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 3823 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:00,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 3823 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:23:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41746 states. [2025-03-03 16:23:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41746 to 41048. [2025-03-03 16:23:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41048 states, 38239 states have (on average 1.6450482491696958) internal successors, (62905), 38920 states have internal predecessors, (62905), 1591 states have call successors, (1591), 521 states have call predecessors, (1591), 1216 states have return successors, (5761), 1670 states have call predecessors, (5761), 1588 states have call successors, (5761) [2025-03-03 16:23:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41048 states to 41048 states and 70257 transitions. [2025-03-03 16:23:02,070 INFO L78 Accepts]: Start accepts. Automaton has 41048 states and 70257 transitions. Word has length 190 [2025-03-03 16:23:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:02,070 INFO L471 AbstractCegarLoop]: Abstraction has 41048 states and 70257 transitions. [2025-03-03 16:23:02,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 41048 states and 70257 transitions. [2025-03-03 16:23:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:23:02,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:02,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:02,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 16:23:02,082 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:02,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 219785288, now seen corresponding path program 1 times [2025-03-03 16:23:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:02,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320330664] [2025-03-03 16:23:02,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:02,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:02,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:23:02,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:23:02,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:02,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320330664] [2025-03-03 16:23:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320330664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:02,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:02,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792600061] [2025-03-03 16:23:02,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:02,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:02,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:02,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:02,198 INFO L87 Difference]: Start difference. First operand 41048 states and 70257 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:05,696 INFO L93 Difference]: Finished difference Result 133832 states and 240919 transitions. [2025-03-03 16:23:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2025-03-03 16:23:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:05,992 INFO L225 Difference]: With dead ends: 133832 [2025-03-03 16:23:05,992 INFO L226 Difference]: Without dead ends: 94384 [2025-03-03 16:23:06,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:06,100 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 1393 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 3811 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:06,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 3811 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:23:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94384 states. [2025-03-03 16:23:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94384 to 93145. [2025-03-03 16:23:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93145 states, 87150 states have (on average 1.6938726333907057) internal successors, (147621), 89225 states have internal predecessors, (147621), 2999 states have call successors, (2999), 905 states have call predecessors, (2999), 2994 states have return successors, (19457), 3142 states have call predecessors, (19457), 2996 states have call successors, (19457) [2025-03-03 16:23:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93145 states to 93145 states and 170077 transitions. [2025-03-03 16:23:10,937 INFO L78 Accepts]: Start accepts. Automaton has 93145 states and 170077 transitions. Word has length 190 [2025-03-03 16:23:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:10,937 INFO L471 AbstractCegarLoop]: Abstraction has 93145 states and 170077 transitions. [2025-03-03 16:23:10,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 93145 states and 170077 transitions. [2025-03-03 16:23:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 16:23:10,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:10,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:10,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 16:23:10,957 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:10,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash -664950519, now seen corresponding path program 1 times [2025-03-03 16:23:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:10,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840034787] [2025-03-03 16:23:10,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:10,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:10,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 16:23:10,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 16:23:10,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:10,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840034787] [2025-03-03 16:23:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840034787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:11,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:11,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:11,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950699804] [2025-03-03 16:23:11,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:11,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:11,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:11,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:11,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:11,027 INFO L87 Difference]: Start difference. First operand 93145 states and 170077 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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)