./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-2.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 c28ca11e40cca108d65dd6d7b4fa74385c8fc7845c04d791c76ec52f444c2043 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:35:34,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:35:34,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:35:34,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:35:34,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:35:34,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:35:34,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:35:34,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:35:34,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:35:34,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:35:34,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:35:34,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:35:34,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:35:34,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:35:34,737 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:34,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:35:34,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:35:34,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:35:34,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:35:34,738 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 -> c28ca11e40cca108d65dd6d7b4fa74385c8fc7845c04d791c76ec52f444c2043 [2025-03-08 07:35:34,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:35:34,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:35:34,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:35:34,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:35:34,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:35:34,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-2.c [2025-03-08 07:35:36,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f5a1c37/4a2555b166b54f3cbe511931f1ca72d6/FLAG35cc35a51 [2025-03-08 07:35:36,456 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:35:36,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.08.cil-2.c [2025-03-08 07:35:36,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f5a1c37/4a2555b166b54f3cbe511931f1ca72d6/FLAG35cc35a51 [2025-03-08 07:35:36,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f5a1c37/4a2555b166b54f3cbe511931f1ca72d6 [2025-03-08 07:35:36,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:35:36,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:35:36,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:36,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:35:36,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:35:36,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d984a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36, skipping insertion in model container [2025-03-08 07:35:36,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:35:36,670 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_3.cil+token_ring.08.cil-2.c[911,924] [2025-03-08 07:35:36,731 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_3.cil+token_ring.08.cil-2.c[8416,8429] [2025-03-08 07:35:36,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:36,802 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:35:36,811 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_3.cil+token_ring.08.cil-2.c[911,924] [2025-03-08 07:35:36,834 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_3.cil+token_ring.08.cil-2.c[8416,8429] [2025-03-08 07:35:36,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:36,885 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:35:36,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36 WrapperNode [2025-03-08 07:35:36,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:36,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:36,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:35:36,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:35:36,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,950 INFO L138 Inliner]: procedures = 71, calls = 86, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 827 [2025-03-08 07:35:36,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:36,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:35:36,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:35:36,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:35:36,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,994 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:35:36,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:36,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:37,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:37,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:37,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:37,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:37,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:35:37,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:35:37,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:35:37,013 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:35:37,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (1/1) ... [2025-03-08 07:35:37,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:35:37,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:35:37,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:35:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:35:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:35:37,088 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:35:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:35:37,088 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:35:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:35:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:35:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:35:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:35:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:35:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:35:37,089 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:35:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:35:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:35:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:35:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:35:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:35:37,090 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:35:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:35:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:35:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:35:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:35:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:35:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:35:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:35:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:35:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:35:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:35:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:35:37,201 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:35:37,202 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:35:37,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-08 07:35:37,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-08 07:35:37,853 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-08 07:35:37,974 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-08 07:35:37,975 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:35:38,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:35:38,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:35:38,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:38 BoogieIcfgContainer [2025-03-08 07:35:38,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:35:38,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:35:38,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:35:38,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:35:38,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:35:36" (1/3) ... [2025-03-08 07:35:38,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3e7d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:38, skipping insertion in model container [2025-03-08 07:35:38,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:36" (2/3) ... [2025-03-08 07:35:38,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e3e7d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:38, skipping insertion in model container [2025-03-08 07:35:38,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:38" (3/3) ... [2025-03-08 07:35:38,009 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.08.cil-2.c [2025-03-08 07:35:38,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:35:38,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.08.cil-2.c that has 16 procedures, 401 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-08 07:35:38,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:35:38,091 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;@202f60ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:35:38,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:35:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 345 states have (on average 1.5826086956521739) internal successors, (546), 351 states have internal predecessors, (546), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 07:35:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:38,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:38,101 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] [2025-03-08 07:35:38,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:38,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2140955548, now seen corresponding path program 1 times [2025-03-08 07:35:38,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:38,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469048379] [2025-03-08 07:35:38,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:38,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:38,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:38,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:38,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:38,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:38,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469048379] [2025-03-08 07:35:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469048379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:38,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:38,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743782450] [2025-03-08 07:35:38,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:38,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:38,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:38,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:38,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:38,462 INFO L87 Difference]: Start difference. First operand has 401 states, 345 states have (on average 1.5826086956521739) internal successors, (546), 351 states have internal predecessors, (546), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 07:35:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:39,203 INFO L93 Difference]: Finished difference Result 892 states and 1391 transitions. [2025-03-08 07:35:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:39,218 INFO L225 Difference]: With dead ends: 892 [2025-03-08 07:35:39,220 INFO L226 Difference]: Without dead ends: 505 [2025-03-08 07:35:39,224 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-08 07:35:39,229 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 437 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:39,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1296 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-08 07:35:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 498. [2025-03-08 07:35:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 421 states have (on average 1.5249406175771971) internal successors, (642), 428 states have internal predecessors, (642), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2025-03-08 07:35:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 749 transitions. [2025-03-08 07:35:39,306 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 749 transitions. Word has length 63 [2025-03-08 07:35:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:39,306 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 749 transitions. [2025-03-08 07:35:39,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 07:35:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 749 transitions. [2025-03-08 07:35:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:39,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:39,309 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] [2025-03-08 07:35:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:35:39,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:39,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1136731196, now seen corresponding path program 1 times [2025-03-08 07:35:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739581496] [2025-03-08 07:35:39,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:39,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:39,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:39,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:39,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:39,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:39,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739581496] [2025-03-08 07:35:39,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739581496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:39,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194557752] [2025-03-08 07:35:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:39,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:39,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:39,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:39,506 INFO L87 Difference]: Start difference. First operand 498 states and 749 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-08 07:35:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:40,222 INFO L93 Difference]: Finished difference Result 853 states and 1252 transitions. [2025-03-08 07:35:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:40,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:40,230 INFO L225 Difference]: With dead ends: 853 [2025-03-08 07:35:40,230 INFO L226 Difference]: Without dead ends: 652 [2025-03-08 07:35:40,231 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-08 07:35:40,232 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 867 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:40,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1384 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-08 07:35:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 606. [2025-03-08 07:35:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 507 states have (on average 1.5069033530571991) internal successors, (764), 516 states have internal predecessors, (764), 66 states have call successors, (66), 29 states have call predecessors, (66), 31 states have return successors, (75), 64 states have call predecessors, (75), 62 states have call successors, (75) [2025-03-08 07:35:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 905 transitions. [2025-03-08 07:35:40,274 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 905 transitions. Word has length 63 [2025-03-08 07:35:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:40,274 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 905 transitions. [2025-03-08 07:35:40,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-08 07:35:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 905 transitions. [2025-03-08 07:35:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:40,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:40,280 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] [2025-03-08 07:35:40,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:35:40,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1144490555, now seen corresponding path program 1 times [2025-03-08 07:35:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413435470] [2025-03-08 07:35:40,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:40,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:40,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:40,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:40,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413435470] [2025-03-08 07:35:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413435470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351804713] [2025-03-08 07:35:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:40,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:40,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:40,393 INFO L87 Difference]: Start difference. First operand 606 states and 905 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:41,539 INFO L93 Difference]: Finished difference Result 1982 states and 2883 transitions. [2025-03-08 07:35:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:41,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 63 [2025-03-08 07:35:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:41,553 INFO L225 Difference]: With dead ends: 1982 [2025-03-08 07:35:41,553 INFO L226 Difference]: Without dead ends: 1661 [2025-03-08 07:35:41,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:35:41,556 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 2740 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2758 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:41,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2758 Valid, 1739 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:35:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-03-08 07:35:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1614. [2025-03-08 07:35:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1310 states have (on average 1.4221374045801527) internal successors, (1863), 1334 states have internal predecessors, (1863), 176 states have call successors, (176), 112 states have call predecessors, (176), 126 states have return successors, (208), 170 states have call predecessors, (208), 172 states have call successors, (208) [2025-03-08 07:35:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2247 transitions. [2025-03-08 07:35:41,702 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2247 transitions. Word has length 63 [2025-03-08 07:35:41,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:41,702 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2247 transitions. [2025-03-08 07:35:41,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2247 transitions. [2025-03-08 07:35:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:41,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:41,704 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] [2025-03-08 07:35:41,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:35:41,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:41,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1738304712, now seen corresponding path program 1 times [2025-03-08 07:35:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50430940] [2025-03-08 07:35:41,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:41,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:41,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:41,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:41,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:41,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50430940] [2025-03-08 07:35:41,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50430940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:41,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801030698] [2025-03-08 07:35:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:41,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:41,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:41,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:41,808 INFO L87 Difference]: Start difference. First operand 1614 states and 2247 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-08 07:35:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:41,882 INFO L93 Difference]: Finished difference Result 2977 states and 4115 transitions. [2025-03-08 07:35:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2025-03-08 07:35:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:41,891 INFO L225 Difference]: With dead ends: 2977 [2025-03-08 07:35:41,891 INFO L226 Difference]: Without dead ends: 1654 [2025-03-08 07:35:41,894 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-08 07:35:41,895 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 0 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:41,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2954 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-03-08 07:35:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1654. [2025-03-08 07:35:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1342 states have (on average 1.4076005961251863) internal successors, (1889), 1366 states have internal predecessors, (1889), 176 states have call successors, (176), 112 states have call predecessors, (176), 134 states have return successors, (216), 178 states have call predecessors, (216), 172 states have call successors, (216) [2025-03-08 07:35:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2281 transitions. [2025-03-08 07:35:41,972 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2281 transitions. Word has length 64 [2025-03-08 07:35:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:41,972 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2281 transitions. [2025-03-08 07:35:41,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-08 07:35:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2281 transitions. [2025-03-08 07:35:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:41,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:41,973 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] [2025-03-08 07:35:41,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:35:41,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:41,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 211995543, now seen corresponding path program 1 times [2025-03-08 07:35:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791411217] [2025-03-08 07:35:41,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:41,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:41,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:41,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:42,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791411217] [2025-03-08 07:35:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791411217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85166911] [2025-03-08 07:35:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:42,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:42,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:42,073 INFO L87 Difference]: Start difference. First operand 1654 states and 2281 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-08 07:35:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:43,206 INFO L93 Difference]: Finished difference Result 4873 states and 6698 transitions. [2025-03-08 07:35:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:43,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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 64 [2025-03-08 07:35:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:43,219 INFO L225 Difference]: With dead ends: 4873 [2025-03-08 07:35:43,219 INFO L226 Difference]: Without dead ends: 1942 [2025-03-08 07:35:43,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:35:43,228 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 2769 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2787 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:43,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2787 Valid, 1780 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:35:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2025-03-08 07:35:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1872. [2025-03-08 07:35:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1488 states have (on average 1.3588709677419355) internal successors, (2022), 1514 states have internal predecessors, (2022), 216 states have call successors, (216), 140 states have call predecessors, (216), 166 states have return successors, (262), 220 states have call predecessors, (262), 212 states have call successors, (262) [2025-03-08 07:35:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2500 transitions. [2025-03-08 07:35:43,352 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2500 transitions. Word has length 64 [2025-03-08 07:35:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:43,353 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2500 transitions. [2025-03-08 07:35:43,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-08 07:35:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2500 transitions. [2025-03-08 07:35:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:43,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:43,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:35:43,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1778458609, now seen corresponding path program 1 times [2025-03-08 07:35:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558812555] [2025-03-08 07:35:43,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:43,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:43,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:43,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558812555] [2025-03-08 07:35:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558812555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924515333] [2025-03-08 07:35:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:43,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:43,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:43,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:43,429 INFO L87 Difference]: Start difference. First operand 1872 states and 2500 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-08 07:35:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:43,512 INFO L93 Difference]: Finished difference Result 3513 states and 4653 transitions. [2025-03-08 07:35:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 86 [2025-03-08 07:35:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:43,523 INFO L225 Difference]: With dead ends: 3513 [2025-03-08 07:35:43,523 INFO L226 Difference]: Without dead ends: 1932 [2025-03-08 07:35:43,527 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-08 07:35:43,528 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 0 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2915 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-08 07:35:43,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2915 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2025-03-08 07:35:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1932. [2025-03-08 07:35:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1536 states have (on average 1.34375) internal successors, (2064), 1562 states have internal predecessors, (2064), 216 states have call successors, (216), 140 states have call predecessors, (216), 178 states have return successors, (274), 232 states have call predecessors, (274), 212 states have call successors, (274) [2025-03-08 07:35:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2554 transitions. [2025-03-08 07:35:43,655 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2554 transitions. Word has length 86 [2025-03-08 07:35:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:43,655 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2554 transitions. [2025-03-08 07:35:43,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-08 07:35:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2554 transitions. [2025-03-08 07:35:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:43,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:43,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:43,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:35:43,657 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1546927664, now seen corresponding path program 1 times [2025-03-08 07:35:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542094190] [2025-03-08 07:35:43,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:43,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:43,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:43,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:43,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:43,728 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-08 07:35:43,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:43,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542094190] [2025-03-08 07:35:43,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542094190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:43,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:43,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:35:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038440241] [2025-03-08 07:35:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:43,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:35:43,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:43,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:35:43,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:35:43,730 INFO L87 Difference]: Start difference. First operand 1932 states and 2554 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:35:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:44,206 INFO L93 Difference]: Finished difference Result 5209 states and 6856 transitions. [2025-03-08 07:35:44,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:35:44,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2025-03-08 07:35:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:44,224 INFO L225 Difference]: With dead ends: 5209 [2025-03-08 07:35:44,224 INFO L226 Difference]: Without dead ends: 3569 [2025-03-08 07:35:44,229 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-08 07:35:44,230 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 792 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:44,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 659 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2025-03-08 07:35:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3569. [2025-03-08 07:35:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 2800 states have (on average 1.3039285714285713) internal successors, (3651), 2860 states have internal predecessors, (3651), 405 states have call successors, (405), 272 states have call predecessors, (405), 362 states have return successors, (606), 441 states have call predecessors, (606), 401 states have call successors, (606) [2025-03-08 07:35:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 4662 transitions. [2025-03-08 07:35:44,460 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 4662 transitions. Word has length 86 [2025-03-08 07:35:44,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:44,460 INFO L471 AbstractCegarLoop]: Abstraction has 3569 states and 4662 transitions. [2025-03-08 07:35:44,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:35:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 4662 transitions. [2025-03-08 07:35:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:35:44,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:44,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:44,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:35:44,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:44,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -438112465, now seen corresponding path program 1 times [2025-03-08 07:35:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:44,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109226768] [2025-03-08 07:35:44,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:44,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:35:44,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:35:44,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:44,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:35:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109226768] [2025-03-08 07:35:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109226768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:44,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:44,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:35:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015626841] [2025-03-08 07:35:44,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:35:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:44,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:35:44,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:44,505 INFO L87 Difference]: Start difference. First operand 3569 states and 4662 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 07:35:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:44,614 INFO L93 Difference]: Finished difference Result 5209 states and 6715 transitions. [2025-03-08 07:35:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:35:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 86 [2025-03-08 07:35:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:44,624 INFO L225 Difference]: With dead ends: 5209 [2025-03-08 07:35:44,625 INFO L226 Difference]: Without dead ends: 1932 [2025-03-08 07:35:44,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:44,631 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 137 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:44,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1024 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2025-03-08 07:35:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1932. [2025-03-08 07:35:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1536 states have (on average 1.3157552083333333) internal successors, (2021), 1562 states have internal predecessors, (2021), 216 states have call successors, (216), 140 states have call predecessors, (216), 178 states have return successors, (274), 232 states have call predecessors, (274), 212 states have call successors, (274) [2025-03-08 07:35:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2511 transitions. [2025-03-08 07:35:44,719 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2511 transitions. Word has length 86 [2025-03-08 07:35:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:44,720 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2511 transitions. [2025-03-08 07:35:44,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 07:35:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2511 transitions. [2025-03-08 07:35:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:35:44,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:44,722 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, 1, 1] [2025-03-08 07:35:44,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:35:44,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:44,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1625391285, now seen corresponding path program 1 times [2025-03-08 07:35:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960580328] [2025-03-08 07:35:44,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:44,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:35:44,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:35:44,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:44,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:35:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960580328] [2025-03-08 07:35:44,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960580328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:44,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:44,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:35:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963336329] [2025-03-08 07:35:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:44,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:35:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:44,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:35:44,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:35:44,808 INFO L87 Difference]: Start difference. First operand 1932 states and 2511 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-08 07:35:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:45,799 INFO L93 Difference]: Finished difference Result 4598 states and 5914 transitions. [2025-03-08 07:35:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 87 [2025-03-08 07:35:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:45,812 INFO L225 Difference]: With dead ends: 4598 [2025-03-08 07:35:45,813 INFO L226 Difference]: Without dead ends: 2665 [2025-03-08 07:35:45,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:35:45,819 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 1512 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:45,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 1753 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:35:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2025-03-08 07:35:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2534. [2025-03-08 07:35:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 1989 states have (on average 1.2765208647561588) internal successors, (2539), 2024 states have internal predecessors, (2539), 288 states have call successors, (288), 191 states have call predecessors, (288), 255 states have return successors, (383), 321 states have call predecessors, (383), 284 states have call successors, (383) [2025-03-08 07:35:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3210 transitions. [2025-03-08 07:35:45,932 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3210 transitions. Word has length 87 [2025-03-08 07:35:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:45,932 INFO L471 AbstractCegarLoop]: Abstraction has 2534 states and 3210 transitions. [2025-03-08 07:35:45,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-08 07:35:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3210 transitions. [2025-03-08 07:35:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:45,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:45,936 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] [2025-03-08 07:35:45,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:35:45,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:45,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2078105853, now seen corresponding path program 1 times [2025-03-08 07:35:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:45,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347919109] [2025-03-08 07:35:45,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:45,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:45,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:45,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:45,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:45,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347919109] [2025-03-08 07:35:45,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347919109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:45,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:45,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:35:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037503384] [2025-03-08 07:35:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:45,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:35:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:45,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:35:45,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:45,998 INFO L87 Difference]: Start difference. First operand 2534 states and 3210 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:46,063 INFO L93 Difference]: Finished difference Result 2805 states and 3633 transitions. [2025-03-08 07:35:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:35:46,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:46,077 INFO L225 Difference]: With dead ends: 2805 [2025-03-08 07:35:46,077 INFO L226 Difference]: Without dead ends: 2534 [2025-03-08 07:35:46,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:35:46,078 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 430 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:46,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 723 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2025-03-08 07:35:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2534. [2025-03-08 07:35:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 1989 states have (on average 1.2760180995475112) internal successors, (2538), 2024 states have internal predecessors, (2538), 288 states have call successors, (288), 191 states have call predecessors, (288), 255 states have return successors, (383), 321 states have call predecessors, (383), 284 states have call successors, (383) [2025-03-08 07:35:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3209 transitions. [2025-03-08 07:35:46,234 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3209 transitions. Word has length 133 [2025-03-08 07:35:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:46,235 INFO L471 AbstractCegarLoop]: Abstraction has 2534 states and 3209 transitions. [2025-03-08 07:35:46,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3209 transitions. [2025-03-08 07:35:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:46,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:46,240 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] [2025-03-08 07:35:46,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:35:46,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash 615695396, now seen corresponding path program 1 times [2025-03-08 07:35:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:46,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939420547] [2025-03-08 07:35:46,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:46,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:46,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:46,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:46,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939420547] [2025-03-08 07:35:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939420547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:46,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385985845] [2025-03-08 07:35:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:46,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:46,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:46,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:46,407 INFO L87 Difference]: Start difference. First operand 2534 states and 3209 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:46,994 INFO L93 Difference]: Finished difference Result 3098 states and 4103 transitions. [2025-03-08 07:35:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:46,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:47,007 INFO L225 Difference]: With dead ends: 3098 [2025-03-08 07:35:47,007 INFO L226 Difference]: Without dead ends: 2832 [2025-03-08 07:35:47,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:47,010 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1003 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:47,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1392 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:35:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2025-03-08 07:35:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2809. [2025-03-08 07:35:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2809 states, 2240 states have (on average 1.3116071428571427) internal successors, (2938), 2276 states have internal predecessors, (2938), 305 states have call successors, (305), 197 states have call predecessors, (305), 262 states have return successors, (401), 338 states have call predecessors, (401), 301 states have call successors, (401) [2025-03-08 07:35:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 3644 transitions. [2025-03-08 07:35:47,167 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 3644 transitions. Word has length 133 [2025-03-08 07:35:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:47,167 INFO L471 AbstractCegarLoop]: Abstraction has 2809 states and 3644 transitions. [2025-03-08 07:35:47,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 3644 transitions. [2025-03-08 07:35:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:47,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:47,169 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] [2025-03-08 07:35:47,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:35:47,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:47,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1419455138, now seen corresponding path program 1 times [2025-03-08 07:35:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:47,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639840129] [2025-03-08 07:35:47,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:47,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:47,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:47,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:47,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:47,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639840129] [2025-03-08 07:35:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639840129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:47,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:47,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084635727] [2025-03-08 07:35:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:47,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:47,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:47,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:47,286 INFO L87 Difference]: Start difference. First operand 2809 states and 3644 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:47,962 INFO L93 Difference]: Finished difference Result 3701 states and 5070 transitions. [2025-03-08 07:35:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:47,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:47,975 INFO L225 Difference]: With dead ends: 3701 [2025-03-08 07:35:47,975 INFO L226 Difference]: Without dead ends: 3160 [2025-03-08 07:35:47,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:47,978 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1004 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:47,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 2563 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2025-03-08 07:35:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 3065. [2025-03-08 07:35:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3065 states, 2472 states have (on average 1.3349514563106797) internal successors, (3300), 2509 states have internal predecessors, (3300), 322 states have call successors, (322), 203 states have call predecessors, (322), 269 states have return successors, (421), 356 states have call predecessors, (421), 318 states have call successors, (421) [2025-03-08 07:35:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4043 transitions. [2025-03-08 07:35:48,149 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4043 transitions. Word has length 133 [2025-03-08 07:35:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:48,150 INFO L471 AbstractCegarLoop]: Abstraction has 3065 states and 4043 transitions. [2025-03-08 07:35:48,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4043 transitions. [2025-03-08 07:35:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:48,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:48,152 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] [2025-03-08 07:35:48,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:35:48,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:48,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash 135543971, now seen corresponding path program 1 times [2025-03-08 07:35:48,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:48,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198911223] [2025-03-08 07:35:48,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:48,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:48,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:48,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:48,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:48,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:48,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:48,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198911223] [2025-03-08 07:35:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198911223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:48,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526980205] [2025-03-08 07:35:48,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:48,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:48,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:48,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:48,258 INFO L87 Difference]: Start difference. First operand 3065 states and 4043 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:48,945 INFO L93 Difference]: Finished difference Result 4515 states and 6358 transitions. [2025-03-08 07:35:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:48,959 INFO L225 Difference]: With dead ends: 4515 [2025-03-08 07:35:48,959 INFO L226 Difference]: Without dead ends: 3718 [2025-03-08 07:35:48,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:48,962 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 999 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:48,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 2547 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:35:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-03-08 07:35:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3610. [2025-03-08 07:35:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 2967 states have (on average 1.3761375126390294) internal successors, (4083), 3008 states have internal predecessors, (4083), 356 states have call successors, (356), 215 states have call predecessors, (356), 285 states have return successors, (467), 392 states have call predecessors, (467), 352 states have call successors, (467) [2025-03-08 07:35:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4906 transitions. [2025-03-08 07:35:49,173 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4906 transitions. Word has length 133 [2025-03-08 07:35:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:49,174 INFO L471 AbstractCegarLoop]: Abstraction has 3610 states and 4906 transitions. [2025-03-08 07:35:49,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4906 transitions. [2025-03-08 07:35:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:49,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:49,177 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] [2025-03-08 07:35:49,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:35:49,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:49,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 371222146, now seen corresponding path program 1 times [2025-03-08 07:35:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:49,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332116551] [2025-03-08 07:35:49,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:49,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:49,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:49,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:49,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:49,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332116551] [2025-03-08 07:35:49,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332116551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:49,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543779004] [2025-03-08 07:35:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:49,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:49,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:49,304 INFO L87 Difference]: Start difference. First operand 3610 states and 4906 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:50,118 INFO L93 Difference]: Finished difference Result 6270 states and 9191 transitions. [2025-03-08 07:35:50,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:50,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:50,136 INFO L225 Difference]: With dead ends: 6270 [2025-03-08 07:35:50,136 INFO L226 Difference]: Without dead ends: 4928 [2025-03-08 07:35:50,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:50,140 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 994 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:50,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 2535 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-08 07:35:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4793. [2025-03-08 07:35:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4793 states, 4044 states have (on average 1.4379327398615231) internal successors, (5815), 4099 states have internal predecessors, (5815), 424 states have call successors, (424), 239 states have call predecessors, (424), 323 states have return successors, (583), 464 states have call predecessors, (583), 420 states have call successors, (583) [2025-03-08 07:35:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4793 states to 4793 states and 6822 transitions. [2025-03-08 07:35:50,389 INFO L78 Accepts]: Start accepts. Automaton has 4793 states and 6822 transitions. Word has length 133 [2025-03-08 07:35:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:50,390 INFO L471 AbstractCegarLoop]: Abstraction has 4793 states and 6822 transitions. [2025-03-08 07:35:50,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4793 states and 6822 transitions. [2025-03-08 07:35:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:50,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:50,393 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] [2025-03-08 07:35:50,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:35:50,393 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -452459325, now seen corresponding path program 1 times [2025-03-08 07:35:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582738304] [2025-03-08 07:35:50,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:50,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:50,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:50,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:50,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582738304] [2025-03-08 07:35:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582738304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655288802] [2025-03-08 07:35:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:50,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:50,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:50,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:50,513 INFO L87 Difference]: Start difference. First operand 4793 states and 6822 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:51,338 INFO L93 Difference]: Finished difference Result 10133 states and 15605 transitions. [2025-03-08 07:35:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:51,362 INFO L225 Difference]: With dead ends: 10133 [2025-03-08 07:35:51,363 INFO L226 Difference]: Without dead ends: 7608 [2025-03-08 07:35:51,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:51,369 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 989 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:51,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 2523 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2025-03-08 07:35:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 7420. [2025-03-08 07:35:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7420 states, 6441 states have (on average 1.512653314702686) internal successors, (9743), 6542 states have internal predecessors, (9743), 560 states have call successors, (560), 287 states have call predecessors, (560), 417 states have return successors, (911), 608 states have call predecessors, (911), 556 states have call successors, (911) [2025-03-08 07:35:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7420 states to 7420 states and 11214 transitions. [2025-03-08 07:35:51,694 INFO L78 Accepts]: Start accepts. Automaton has 7420 states and 11214 transitions. Word has length 133 [2025-03-08 07:35:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:51,694 INFO L471 AbstractCegarLoop]: Abstraction has 7420 states and 11214 transitions. [2025-03-08 07:35:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 7420 states and 11214 transitions. [2025-03-08 07:35:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:51,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:51,698 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] [2025-03-08 07:35:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:35:51,698 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash 629348962, now seen corresponding path program 1 times [2025-03-08 07:35:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008440451] [2025-03-08 07:35:51,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:51,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:51,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:51,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:51,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008440451] [2025-03-08 07:35:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008440451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442629417] [2025-03-08 07:35:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:51,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:51,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:51,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:51,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:51,802 INFO L87 Difference]: Start difference. First operand 7420 states and 11214 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:52,526 INFO L93 Difference]: Finished difference Result 13734 states and 22000 transitions. [2025-03-08 07:35:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:35:52,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:52,559 INFO L225 Difference]: With dead ends: 13734 [2025-03-08 07:35:52,559 INFO L226 Difference]: Without dead ends: 8582 [2025-03-08 07:35:52,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:52,574 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 764 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:52,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1035 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8582 states. [2025-03-08 07:35:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8582 to 7420. [2025-03-08 07:35:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7420 states, 6441 states have (on average 1.5100139729855613) internal successors, (9726), 6542 states have internal predecessors, (9726), 560 states have call successors, (560), 287 states have call predecessors, (560), 417 states have return successors, (911), 608 states have call predecessors, (911), 556 states have call successors, (911) [2025-03-08 07:35:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7420 states to 7420 states and 11197 transitions. [2025-03-08 07:35:52,950 INFO L78 Accepts]: Start accepts. Automaton has 7420 states and 11197 transitions. Word has length 133 [2025-03-08 07:35:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:52,951 INFO L471 AbstractCegarLoop]: Abstraction has 7420 states and 11197 transitions. [2025-03-08 07:35:52,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 7420 states and 11197 transitions. [2025-03-08 07:35:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:52,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:52,954 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] [2025-03-08 07:35:52,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:35:52,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:52,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash 110056675, now seen corresponding path program 1 times [2025-03-08 07:35:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:52,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841996903] [2025-03-08 07:35:52,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:52,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:52,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:52,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:52,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:53,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:53,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841996903] [2025-03-08 07:35:53,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841996903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:53,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:53,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363219494] [2025-03-08 07:35:53,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:53,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:53,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:53,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:53,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:53,024 INFO L87 Difference]: Start difference. First operand 7420 states and 11197 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:53,566 INFO L93 Difference]: Finished difference Result 13651 states and 21800 transitions. [2025-03-08 07:35:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:35:53,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:53,596 INFO L225 Difference]: With dead ends: 13651 [2025-03-08 07:35:53,596 INFO L226 Difference]: Without dead ends: 8499 [2025-03-08 07:35:53,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:53,611 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 761 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:53,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1027 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2025-03-08 07:35:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 7420. [2025-03-08 07:35:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7420 states, 6441 states have (on average 1.5073746312684366) internal successors, (9709), 6542 states have internal predecessors, (9709), 560 states have call successors, (560), 287 states have call predecessors, (560), 417 states have return successors, (911), 608 states have call predecessors, (911), 556 states have call successors, (911) [2025-03-08 07:35:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7420 states to 7420 states and 11180 transitions. [2025-03-08 07:35:53,971 INFO L78 Accepts]: Start accepts. Automaton has 7420 states and 11180 transitions. Word has length 133 [2025-03-08 07:35:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:53,971 INFO L471 AbstractCegarLoop]: Abstraction has 7420 states and 11180 transitions. [2025-03-08 07:35:53,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 7420 states and 11180 transitions. [2025-03-08 07:35:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:53,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:53,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:53,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:35:53,975 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:53,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -876526014, now seen corresponding path program 1 times [2025-03-08 07:35:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33796826] [2025-03-08 07:35:53,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:53,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:53,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:53,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:53,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33796826] [2025-03-08 07:35:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33796826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:54,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:54,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945883037] [2025-03-08 07:35:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:54,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:54,050 INFO L87 Difference]: Start difference. First operand 7420 states and 11180 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:54,643 INFO L93 Difference]: Finished difference Result 13568 states and 21600 transitions. [2025-03-08 07:35:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:35:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:54,668 INFO L225 Difference]: With dead ends: 13568 [2025-03-08 07:35:54,668 INFO L226 Difference]: Without dead ends: 8416 [2025-03-08 07:35:54,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:54,682 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 758 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:54,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1019 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:35:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2025-03-08 07:35:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 7420. [2025-03-08 07:35:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7420 states, 6441 states have (on average 1.504735289551312) internal successors, (9692), 6542 states have internal predecessors, (9692), 560 states have call successors, (560), 287 states have call predecessors, (560), 417 states have return successors, (911), 608 states have call predecessors, (911), 556 states have call successors, (911) [2025-03-08 07:35:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7420 states to 7420 states and 11163 transitions. [2025-03-08 07:35:55,216 INFO L78 Accepts]: Start accepts. Automaton has 7420 states and 11163 transitions. Word has length 133 [2025-03-08 07:35:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:55,216 INFO L471 AbstractCegarLoop]: Abstraction has 7420 states and 11163 transitions. [2025-03-08 07:35:55,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7420 states and 11163 transitions. [2025-03-08 07:35:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:55,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:55,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:55,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:35:55,222 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:55,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash 200027395, now seen corresponding path program 1 times [2025-03-08 07:35:55,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:55,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168984887] [2025-03-08 07:35:55,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:55,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:55,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:55,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:55,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:55,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168984887] [2025-03-08 07:35:55,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168984887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:55,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728842079] [2025-03-08 07:35:55,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:55,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:55,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:55,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:55,334 INFO L87 Difference]: Start difference. First operand 7420 states and 11163 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:56,606 INFO L93 Difference]: Finished difference Result 18544 states and 29902 transitions. [2025-03-08 07:35:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:56,645 INFO L225 Difference]: With dead ends: 18544 [2025-03-08 07:35:56,645 INFO L226 Difference]: Without dead ends: 13392 [2025-03-08 07:35:56,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:56,657 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 960 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:56,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 2454 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2025-03-08 07:35:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 13160. [2025-03-08 07:35:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13160 states, 11667 states have (on average 1.5686980371989372) internal successors, (18302), 11914 states have internal predecessors, (18302), 832 states have call successors, (832), 383 states have call predecessors, (832), 659 states have return successors, (1951), 896 states have call predecessors, (1951), 828 states have call successors, (1951) [2025-03-08 07:35:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 21085 transitions. [2025-03-08 07:35:57,195 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 21085 transitions. Word has length 133 [2025-03-08 07:35:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:57,195 INFO L471 AbstractCegarLoop]: Abstraction has 13160 states and 21085 transitions. [2025-03-08 07:35:57,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 21085 transitions. [2025-03-08 07:35:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:35:57,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:57,201 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] [2025-03-08 07:35:57,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:35:57,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:57,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2035870242, now seen corresponding path program 1 times [2025-03-08 07:35:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907077133] [2025-03-08 07:35:57,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:57,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:35:57,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:35:57,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:57,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907077133] [2025-03-08 07:35:57,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907077133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:57,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:57,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:57,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841676492] [2025-03-08 07:35:57,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:57,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:57,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:57,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:57,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:57,289 INFO L87 Difference]: Start difference. First operand 13160 states and 21085 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:35:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:58,739 INFO L93 Difference]: Finished difference Result 39396 states and 67039 transitions. [2025-03-08 07:35:58,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:58,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:35:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:58,832 INFO L225 Difference]: With dead ends: 39396 [2025-03-08 07:35:58,832 INFO L226 Difference]: Without dead ends: 28504 [2025-03-08 07:35:58,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:58,857 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1209 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:58,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 2429 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:35:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28504 states. [2025-03-08 07:36:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28504 to 26083. [2025-03-08 07:36:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26083 states, 23432 states have (on average 1.6231649026971662) internal successors, (38034), 24133 states have internal predecessors, (38034), 1344 states have call successors, (1344), 575 states have call predecessors, (1344), 1305 states have return successors, (5535), 1440 states have call predecessors, (5535), 1340 states have call successors, (5535) [2025-03-08 07:36:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26083 states to 26083 states and 44913 transitions. [2025-03-08 07:36:00,413 INFO L78 Accepts]: Start accepts. Automaton has 26083 states and 44913 transitions. Word has length 133 [2025-03-08 07:36:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:00,413 INFO L471 AbstractCegarLoop]: Abstraction has 26083 states and 44913 transitions. [2025-03-08 07:36:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 26083 states and 44913 transitions. [2025-03-08 07:36:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:36:00,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:00,423 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] [2025-03-08 07:36:00,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:36:00,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:00,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2095090979, now seen corresponding path program 1 times [2025-03-08 07:36:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:00,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610432098] [2025-03-08 07:36:00,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:00,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:00,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:36:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:36:00,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:00,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:00,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610432098] [2025-03-08 07:36:00,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610432098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:00,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:00,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:00,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826728202] [2025-03-08 07:36:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:00,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:00,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:00,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:00,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:00,512 INFO L87 Difference]: Start difference. First operand 26083 states and 44913 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:02,910 INFO L93 Difference]: Finished difference Result 83989 states and 154185 transitions. [2025-03-08 07:36:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:02,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:36:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:03,122 INFO L225 Difference]: With dead ends: 83989 [2025-03-08 07:36:03,123 INFO L226 Difference]: Without dead ends: 60174 [2025-03-08 07:36:03,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:03,196 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 1173 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:03,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 2413 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60174 states. [2025-03-08 07:36:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60174 to 55388. [2025-03-08 07:36:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55388 states, 49967 states have (on average 1.6634578822022534) internal successors, (83118), 52062 states have internal predecessors, (83118), 2336 states have call successors, (2336), 959 states have call predecessors, (2336), 3083 states have return successors, (18815), 2496 states have call predecessors, (18815), 2332 states have call successors, (18815) [2025-03-08 07:36:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55388 states to 55388 states and 104269 transitions. [2025-03-08 07:36:06,919 INFO L78 Accepts]: Start accepts. Automaton has 55388 states and 104269 transitions. Word has length 133 [2025-03-08 07:36:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:06,920 INFO L471 AbstractCegarLoop]: Abstraction has 55388 states and 104269 transitions. [2025-03-08 07:36:06,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55388 states and 104269 transitions. [2025-03-08 07:36:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 07:36:06,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:06,937 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] [2025-03-08 07:36:06,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:36:06,938 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:06,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1505229310, now seen corresponding path program 1 times [2025-03-08 07:36:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654178124] [2025-03-08 07:36:06,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:06,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 07:36:06,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 07:36:06,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:07,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-08 07:36:07,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:07,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654178124] [2025-03-08 07:36:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654178124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:07,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:07,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:07,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900410787] [2025-03-08 07:36:07,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:07,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:07,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:07,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:07,027 INFO L87 Difference]: Start difference. First operand 55388 states and 104269 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:12,306 INFO L93 Difference]: Finished difference Result 185908 states and 379151 transitions. [2025-03-08 07:36:12,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:12,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 133 [2025-03-08 07:36:12,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:13,154 INFO L225 Difference]: With dead ends: 185908 [2025-03-08 07:36:13,155 INFO L226 Difference]: Without dead ends: 132788 [2025-03-08 07:36:13,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:13,285 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1139 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:13,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 2405 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132788 states.