./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44eeab2214dc0ded69d35958321f99e16f5908b9c493335962885511690c0d86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:49:50,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:49:50,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:49:50,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:49:50,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:49:50,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:49:50,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:49:50,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:49:50,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:49:50,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:49:50,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:49:50,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:49:50,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:49:50,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:49:50,631 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:49:50,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:49:50,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:49:50,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:49:50,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:49:50,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:49:50,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:49:50,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:49:50,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:49:50,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:49:50,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:49:50,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:49:50,634 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 -> 44eeab2214dc0ded69d35958321f99e16f5908b9c493335962885511690c0d86 [2025-03-08 06:49:50,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:49:50,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:49:50,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:49:50,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:49:50,892 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:49:50,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-1.c [2025-03-08 06:49:52,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d639a3daa/72a87c2f56184e3c964d91a5e8a52e56/FLAG0969bc769 [2025-03-08 06:49:52,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:49:52,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.09.cil-1.c [2025-03-08 06:49:52,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d639a3daa/72a87c2f56184e3c964d91a5e8a52e56/FLAG0969bc769 [2025-03-08 06:49:53,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d639a3daa/72a87c2f56184e3c964d91a5e8a52e56 [2025-03-08 06:49:53,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:49:53,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:49:53,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:49:53,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:49:53,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:49:53,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:49:53" (1/1) ... [2025-03-08 06:49:53,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660364f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:53, skipping insertion in model container [2025-03-08 06:49:53,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:49:53" (1/1) ... [2025-03-08 06:49:53,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:49:54,331 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/Problem05_label42+token_ring.09.cil-1.c[378560,378573] [2025-03-08 06:49:54,356 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/Problem05_label42+token_ring.09.cil-1.c[383339,383352] [2025-03-08 06:49:54,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:49:54,613 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:49:55,098 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/Problem05_label42+token_ring.09.cil-1.c[378560,378573] [2025-03-08 06:49:55,102 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/Problem05_label42+token_ring.09.cil-1.c[383339,383352] [2025-03-08 06:49:55,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:49:55,156 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:49:55,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55 WrapperNode [2025-03-08 06:49:55,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:49:55,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:49:55,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:49:55,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:49:55,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,603 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-03-08 06:49:55,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:49:55,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:49:55,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:49:55,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:49:55,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,761 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 06:49:55,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:49:55,965 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:49:55,965 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:49:55,965 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:49:55,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (1/1) ... [2025-03-08 06:49:55,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:49:55,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:49:55,991 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 06:49:55,998 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 06:49:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:49:56,014 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:49:56,014 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:49:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:49:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:49:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:49:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:49:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:49:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:49:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:49:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:49:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:49:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:49:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:49:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:49:56,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:49:56,115 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:49:56,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:50:02,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:50:02,010 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:50:02,011 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:50:02,011 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:50:02,012 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:50:02,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:50:02,068 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:50:02,289 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-03-08 06:50:02,290 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:50:02,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:50:02,342 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:50:02,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:02 BoogieIcfgContainer [2025-03-08 06:50:02,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:50:02,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:50:02,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:50:02,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:50:02,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:49:53" (1/3) ... [2025-03-08 06:50:02,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcbb0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:02, skipping insertion in model container [2025-03-08 06:50:02,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:49:55" (2/3) ... [2025-03-08 06:50:02,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcbb0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:50:02, skipping insertion in model container [2025-03-08 06:50:02,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:50:02" (3/3) ... [2025-03-08 06:50:02,353 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.09.cil-1.c [2025-03-08 06:50:02,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:50:02,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.09.cil-1.c that has 7 procedures, 2488 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-08 06:50:02,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:50:02,446 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;@31e75da7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:50:02,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:50:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 06:50:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:02,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:02,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:02,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:02,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash -581836028, now seen corresponding path program 1 times [2025-03-08 06:50:02,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224104830] [2025-03-08 06:50:02,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:02,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:02,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:02,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:02,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:03,043 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 06:50:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:03,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224104830] [2025-03-08 06:50:03,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224104830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:03,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:03,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345059731] [2025-03-08 06:50:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:03,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:03,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:03,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:03,076 INFO L87 Difference]: Start difference. First operand has 2488 states, 2457 states have (on average 1.8416768416768416) internal successors, (4525), 2459 states have internal predecessors, (4525), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:03,722 INFO L93 Difference]: Finished difference Result 5281 states and 9643 transitions. [2025-03-08 06:50:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:50:03,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:03,751 INFO L225 Difference]: With dead ends: 5281 [2025-03-08 06:50:03,751 INFO L226 Difference]: Without dead ends: 2740 [2025-03-08 06:50:03,762 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 06:50:03,765 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 4919 mSDsluCounter, 8983 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 13375 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:03,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 13375 Invalid, 559 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:50:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2025-03-08 06:50:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2717. [2025-03-08 06:50:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2661 states have (on average 1.808718526869598) internal successors, (4813), 2664 states have internal predecessors, (4813), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 06:50:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4896 transitions. [2025-03-08 06:50:03,896 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4896 transitions. Word has length 143 [2025-03-08 06:50:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:03,897 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4896 transitions. [2025-03-08 06:50:03,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:03,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4896 transitions. [2025-03-08 06:50:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:03,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:03,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:03,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:50:03,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash 178846534, now seen corresponding path program 1 times [2025-03-08 06:50:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:03,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887232229] [2025-03-08 06:50:03,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:03,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:03,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:03,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:03,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:04,136 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 06:50:04,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887232229] [2025-03-08 06:50:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887232229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:04,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:04,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:04,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984366289] [2025-03-08 06:50:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:04,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:04,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:04,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:04,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:04,139 INFO L87 Difference]: Start difference. First operand 2717 states and 4896 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:04,514 INFO L93 Difference]: Finished difference Result 3356 states and 5923 transitions. [2025-03-08 06:50:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:04,525 INFO L225 Difference]: With dead ends: 3356 [2025-03-08 06:50:04,525 INFO L226 Difference]: Without dead ends: 2777 [2025-03-08 06:50:04,527 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 06:50:04,528 INFO L435 NwaCegarLoop]: 4311 mSDtfsCounter, 4592 mSDsluCounter, 8497 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4609 SdHoareTripleChecker+Valid, 12808 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:04,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4609 Valid, 12808 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:50:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2025-03-08 06:50:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2717. [2025-03-08 06:50:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2661 states have (on average 1.807966929725667) internal successors, (4811), 2664 states have internal predecessors, (4811), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-08 06:50:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 4894 transitions. [2025-03-08 06:50:04,596 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 4894 transitions. Word has length 143 [2025-03-08 06:50:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:04,597 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 4894 transitions. [2025-03-08 06:50:04,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 4894 transitions. [2025-03-08 06:50:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:04,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:04,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:04,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:50:04,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:04,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1301125733, now seen corresponding path program 1 times [2025-03-08 06:50:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:04,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870489282] [2025-03-08 06:50:04,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:04,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:04,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:04,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:04,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:04,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 06:50:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:04,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870489282] [2025-03-08 06:50:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870489282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052861532] [2025-03-08 06:50:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:04,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:04,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:04,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:04,807 INFO L87 Difference]: Start difference. First operand 2717 states and 4894 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:05,466 INFO L93 Difference]: Finished difference Result 3669 states and 6413 transitions. [2025-03-08 06:50:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:05,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:05,478 INFO L225 Difference]: With dead ends: 3669 [2025-03-08 06:50:05,479 INFO L226 Difference]: Without dead ends: 3090 [2025-03-08 06:50:05,481 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 06:50:05,482 INFO L435 NwaCegarLoop]: 4563 mSDtfsCounter, 4848 mSDsluCounter, 13717 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4865 SdHoareTripleChecker+Valid, 18280 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:05,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4865 Valid, 18280 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2025-03-08 06:50:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 2991. [2025-03-08 06:50:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2910 states have (on average 1.7859106529209623) internal successors, (5197), 2914 states have internal predecessors, (5197), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-03-08 06:50:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 5319 transitions. [2025-03-08 06:50:05,575 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 5319 transitions. Word has length 143 [2025-03-08 06:50:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:05,576 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 5319 transitions. [2025-03-08 06:50:05,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 5319 transitions. [2025-03-08 06:50:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:05,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:05,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:05,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:50:05,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:05,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash -602334362, now seen corresponding path program 1 times [2025-03-08 06:50:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:05,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217424959] [2025-03-08 06:50:05,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:05,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:05,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:05,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:05,755 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 06:50:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217424959] [2025-03-08 06:50:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217424959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129817505] [2025-03-08 06:50:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:05,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:05,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:05,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:05,758 INFO L87 Difference]: Start difference. First operand 2991 states and 5319 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:06,428 INFO L93 Difference]: Finished difference Result 4532 states and 7769 transitions. [2025-03-08 06:50:06,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:06,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:06,448 INFO L225 Difference]: With dead ends: 4532 [2025-03-08 06:50:06,448 INFO L226 Difference]: Without dead ends: 3679 [2025-03-08 06:50:06,453 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 06:50:06,454 INFO L435 NwaCegarLoop]: 4555 mSDtfsCounter, 4840 mSDsluCounter, 13695 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4857 SdHoareTripleChecker+Valid, 18250 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:06,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4857 Valid, 18250 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2025-03-08 06:50:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3571. [2025-03-08 06:50:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3438 states have (on average 1.752763234438627) internal successors, (6026), 3446 states have internal predecessors, (6026), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-03-08 06:50:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 6232 transitions. [2025-03-08 06:50:06,567 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 6232 transitions. Word has length 143 [2025-03-08 06:50:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:06,568 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 6232 transitions. [2025-03-08 06:50:06,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 6232 transitions. [2025-03-08 06:50:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:06,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:06,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:06,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:50:06,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:06,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1243420505, now seen corresponding path program 1 times [2025-03-08 06:50:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:06,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727596020] [2025-03-08 06:50:06,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:06,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:06,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:06,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:06,717 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 06:50:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:06,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727596020] [2025-03-08 06:50:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727596020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:06,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417601991] [2025-03-08 06:50:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:06,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:06,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:06,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:06,719 INFO L87 Difference]: Start difference. First operand 3571 states and 6232 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:07,380 INFO L93 Difference]: Finished difference Result 6392 states and 10752 transitions. [2025-03-08 06:50:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:07,401 INFO L225 Difference]: With dead ends: 6392 [2025-03-08 06:50:07,401 INFO L226 Difference]: Without dead ends: 4959 [2025-03-08 06:50:07,407 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 06:50:07,408 INFO L435 NwaCegarLoop]: 4552 mSDtfsCounter, 4835 mSDsluCounter, 13686 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4852 SdHoareTripleChecker+Valid, 18238 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:07,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4852 Valid, 18238 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2025-03-08 06:50:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4824. [2025-03-08 06:50:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4824 states, 4581 states have (on average 1.7135996507312814) internal successors, (7850), 4603 states have internal predecessors, (7850), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-08 06:50:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 8248 transitions. [2025-03-08 06:50:07,632 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 8248 transitions. Word has length 143 [2025-03-08 06:50:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:07,633 INFO L471 AbstractCegarLoop]: Abstraction has 4824 states and 8248 transitions. [2025-03-08 06:50:07,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 8248 transitions. [2025-03-08 06:50:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:07,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:07,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:07,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:50:07,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -17174714, now seen corresponding path program 1 times [2025-03-08 06:50:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829974741] [2025-03-08 06:50:07,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:07,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:07,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:07,770 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 06:50:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829974741] [2025-03-08 06:50:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829974741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801137813] [2025-03-08 06:50:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:07,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:07,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:07,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:07,775 INFO L87 Difference]: Start difference. First operand 4824 states and 8248 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:08,404 INFO L93 Difference]: Finished difference Result 10465 states and 17466 transitions. [2025-03-08 06:50:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:08,434 INFO L225 Difference]: With dead ends: 10465 [2025-03-08 06:50:08,434 INFO L226 Difference]: Without dead ends: 7779 [2025-03-08 06:50:08,446 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 06:50:08,448 INFO L435 NwaCegarLoop]: 4549 mSDtfsCounter, 4830 mSDsluCounter, 13677 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4847 SdHoareTripleChecker+Valid, 18226 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:08,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4847 Valid, 18226 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7779 states. [2025-03-08 06:50:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7779 to 7591. [2025-03-08 06:50:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 7110 states have (on average 1.6824191279887482) internal successors, (11962), 7178 states have internal predecessors, (11962), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:50:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 12840 transitions. [2025-03-08 06:50:08,653 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 12840 transitions. Word has length 143 [2025-03-08 06:50:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:08,654 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 12840 transitions. [2025-03-08 06:50:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 12840 transitions. [2025-03-08 06:50:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:08,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:08,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:08,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:50:08,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:08,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1269307591, now seen corresponding path program 1 times [2025-03-08 06:50:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075116762] [2025-03-08 06:50:08,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:08,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:08,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:08,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:08,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:08,757 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 06:50:08,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:08,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075116762] [2025-03-08 06:50:08,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075116762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:08,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:08,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:08,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701626224] [2025-03-08 06:50:08,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:08,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:08,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:08,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:08,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:08,761 INFO L87 Difference]: Start difference. First operand 7591 states and 12840 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:09,129 INFO L93 Difference]: Finished difference Result 14206 states and 24060 transitions. [2025-03-08 06:50:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:09,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:09,159 INFO L225 Difference]: With dead ends: 14206 [2025-03-08 06:50:09,159 INFO L226 Difference]: Without dead ends: 8753 [2025-03-08 06:50:09,175 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 06:50:09,175 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 4584 mSDsluCounter, 8472 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4601 SdHoareTripleChecker+Valid, 12770 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:09,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4601 Valid, 12770 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2025-03-08 06:50:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 7591. [2025-03-08 06:50:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 7110 states have (on average 1.680028129395218) internal successors, (11945), 7178 states have internal predecessors, (11945), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:50:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 12823 transitions. [2025-03-08 06:50:09,466 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 12823 transitions. Word has length 143 [2025-03-08 06:50:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:09,466 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 12823 transitions. [2025-03-08 06:50:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 12823 transitions. [2025-03-08 06:50:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:09,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:09,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:09,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:50:09,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1044497626, now seen corresponding path program 1 times [2025-03-08 06:50:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093046499] [2025-03-08 06:50:09,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:09,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:09,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:09,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:09,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:09,566 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 06:50:09,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093046499] [2025-03-08 06:50:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093046499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:09,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571722491] [2025-03-08 06:50:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:09,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:09,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:09,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:09,568 INFO L87 Difference]: Start difference. First operand 7591 states and 12823 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:09,923 INFO L93 Difference]: Finished difference Result 14123 states and 23860 transitions. [2025-03-08 06:50:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:09,947 INFO L225 Difference]: With dead ends: 14123 [2025-03-08 06:50:09,948 INFO L226 Difference]: Without dead ends: 8670 [2025-03-08 06:50:09,961 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 06:50:09,961 INFO L435 NwaCegarLoop]: 4295 mSDtfsCounter, 4581 mSDsluCounter, 8467 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4598 SdHoareTripleChecker+Valid, 12762 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:09,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4598 Valid, 12762 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2025-03-08 06:50:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 7591. [2025-03-08 06:50:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 7110 states have (on average 1.6776371308016877) internal successors, (11928), 7178 states have internal predecessors, (11928), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-08 06:50:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 12806 transitions. [2025-03-08 06:50:10,170 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 12806 transitions. Word has length 143 [2025-03-08 06:50:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:10,170 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 12806 transitions. [2025-03-08 06:50:10,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 12806 transitions. [2025-03-08 06:50:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:10,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:10,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:10,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:50:10,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:10,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2067452135, now seen corresponding path program 1 times [2025-03-08 06:50:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:10,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027566687] [2025-03-08 06:50:10,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:10,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:10,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:10,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 06:50:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027566687] [2025-03-08 06:50:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027566687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:10,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:10,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:10,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919796759] [2025-03-08 06:50:10,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:10,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:10,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:10,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:10,290 INFO L87 Difference]: Start difference. First operand 7591 states and 12806 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:11,050 INFO L93 Difference]: Finished difference Result 19396 states and 32614 transitions. [2025-03-08 06:50:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:11,090 INFO L225 Difference]: With dead ends: 19396 [2025-03-08 06:50:11,091 INFO L226 Difference]: Without dead ends: 13943 [2025-03-08 06:50:11,107 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 06:50:11,109 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 4809 mSDsluCounter, 13640 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4826 SdHoareTripleChecker+Valid, 18176 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:11,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4826 Valid, 18176 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13943 states. [2025-03-08 06:50:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13943 to 13692. [2025-03-08 06:50:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13692 states, 12681 states have (on average 1.662644901821623) internal successors, (21084), 12895 states have internal predecessors, (21084), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-08 06:50:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13692 states to 13692 states and 23306 transitions. [2025-03-08 06:50:11,466 INFO L78 Accepts]: Start accepts. Automaton has 13692 states and 23306 transitions. Word has length 143 [2025-03-08 06:50:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:11,467 INFO L471 AbstractCegarLoop]: Abstraction has 13692 states and 23306 transitions. [2025-03-08 06:50:11,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13692 states and 23306 transitions. [2025-03-08 06:50:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:11,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:11,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:50:11,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:11,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 920911622, now seen corresponding path program 1 times [2025-03-08 06:50:11,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:11,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820151500] [2025-03-08 06:50:11,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:11,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:11,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:11,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:11,590 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 06:50:11,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:11,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820151500] [2025-03-08 06:50:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820151500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316386036] [2025-03-08 06:50:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:11,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:11,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:11,592 INFO L87 Difference]: Start difference. First operand 13692 states and 23306 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:12,840 INFO L93 Difference]: Finished difference Result 41733 states and 72193 transitions. [2025-03-08 06:50:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:12,956 INFO L225 Difference]: With dead ends: 41733 [2025-03-08 06:50:12,957 INFO L226 Difference]: Without dead ends: 30179 [2025-03-08 06:50:12,999 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 06:50:12,999 INFO L435 NwaCegarLoop]: 4531 mSDtfsCounter, 5088 mSDsluCounter, 13620 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 18151 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:12,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 18151 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:50:13,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30179 states. [2025-03-08 06:50:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30179 to 27499. [2025-03-08 06:50:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27499 states, 25298 states have (on average 1.6693809787334968) internal successors, (42232), 25966 states have internal predecessors, (42232), 1143 states have call successors, (1143), 390 states have call predecessors, (1143), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-03-08 06:50:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27499 states to 27499 states and 48614 transitions. [2025-03-08 06:50:13,838 INFO L78 Accepts]: Start accepts. Automaton has 27499 states and 48614 transitions. Word has length 143 [2025-03-08 06:50:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:13,838 INFO L471 AbstractCegarLoop]: Abstraction has 27499 states and 48614 transitions. [2025-03-08 06:50:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 27499 states and 48614 transitions. [2025-03-08 06:50:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:13,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:13,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:13,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:50:13,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:13,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -362999545, now seen corresponding path program 1 times [2025-03-08 06:50:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212811523] [2025-03-08 06:50:13,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:13,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:13,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:13,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:13,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:14,038 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 06:50:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212811523] [2025-03-08 06:50:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212811523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293241868] [2025-03-08 06:50:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:14,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:14,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:14,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:14,040 INFO L87 Difference]: Start difference. First operand 27499 states and 48614 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:15,856 INFO L93 Difference]: Finished difference Result 88540 states and 162999 transitions. [2025-03-08 06:50:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:15,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:16,110 INFO L225 Difference]: With dead ends: 88540 [2025-03-08 06:50:16,110 INFO L226 Difference]: Without dead ends: 63179 [2025-03-08 06:50:16,181 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 06:50:16,182 INFO L435 NwaCegarLoop]: 4524 mSDtfsCounter, 5020 mSDsluCounter, 13601 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5047 SdHoareTripleChecker+Valid, 18125 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:16,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5047 Valid, 18125 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:50:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63179 states. [2025-03-08 06:50:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63179 to 58905. [2025-03-08 06:50:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58905 states, 53870 states have (on average 1.6846111007982179) internal successors, (90750), 55932 states have internal predecessors, (90750), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:50:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58905 states to 58905 states and 111532 transitions. [2025-03-08 06:50:18,964 INFO L78 Accepts]: Start accepts. Automaton has 58905 states and 111532 transitions. Word has length 143 [2025-03-08 06:50:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:18,965 INFO L471 AbstractCegarLoop]: Abstraction has 58905 states and 111532 transitions. [2025-03-08 06:50:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 58905 states and 111532 transitions. [2025-03-08 06:50:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:18,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:18,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:18,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:50:18,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:18,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:18,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1186681016, now seen corresponding path program 1 times [2025-03-08 06:50:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:18,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806686111] [2025-03-08 06:50:18,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:18,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:18,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:18,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:18,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:18,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:19,068 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 06:50:19,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806686111] [2025-03-08 06:50:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806686111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:19,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790302627] [2025-03-08 06:50:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:19,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:19,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:19,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:19,071 INFO L87 Difference]: Start difference. First operand 58905 states and 111532 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:21,435 INFO L93 Difference]: Finished difference Result 133184 states and 264178 transitions. [2025-03-08 06:50:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:21,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:21,893 INFO L225 Difference]: With dead ends: 133184 [2025-03-08 06:50:21,894 INFO L226 Difference]: Without dead ends: 76417 [2025-03-08 06:50:22,037 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 06:50:22,039 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4572 mSDsluCounter, 8444 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 12728 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:22,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 12728 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76417 states. [2025-03-08 06:50:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76417 to 58905. [2025-03-08 06:50:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58905 states, 53870 states have (on average 1.682216447002042) internal successors, (90621), 55932 states have internal predecessors, (90621), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:50:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58905 states to 58905 states and 111403 transitions. [2025-03-08 06:50:27,102 INFO L78 Accepts]: Start accepts. Automaton has 58905 states and 111403 transitions. Word has length 143 [2025-03-08 06:50:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:27,102 INFO L471 AbstractCegarLoop]: Abstraction has 58905 states and 111403 transitions. [2025-03-08 06:50:27,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 58905 states and 111403 transitions. [2025-03-08 06:50:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:27,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:27,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:50:27,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -104872729, now seen corresponding path program 1 times [2025-03-08 06:50:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416007646] [2025-03-08 06:50:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:27,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:27,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:27,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:27,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:27,190 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 06:50:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:27,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416007646] [2025-03-08 06:50:27,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416007646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:27,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:27,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:50:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821080385] [2025-03-08 06:50:27,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:27,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:50:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:27,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:50:27,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:50:27,192 INFO L87 Difference]: Start difference. First operand 58905 states and 111403 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:30,297 INFO L93 Difference]: Finished difference Result 130995 states and 259542 transitions. [2025-03-08 06:50:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:50:30,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:30,642 INFO L225 Difference]: With dead ends: 130995 [2025-03-08 06:50:30,642 INFO L226 Difference]: Without dead ends: 74228 [2025-03-08 06:50:30,802 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 06:50:30,803 INFO L435 NwaCegarLoop]: 4281 mSDtfsCounter, 4569 mSDsluCounter, 8439 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4586 SdHoareTripleChecker+Valid, 12720 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:30,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4586 Valid, 12720 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:50:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74228 states. [2025-03-08 06:50:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74228 to 58905. [2025-03-08 06:50:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58905 states, 53870 states have (on average 1.6798217932058659) internal successors, (90492), 55932 states have internal predecessors, (90492), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-08 06:50:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58905 states to 58905 states and 111274 transitions. [2025-03-08 06:50:34,913 INFO L78 Accepts]: Start accepts. Automaton has 58905 states and 111274 transitions. Word has length 143 [2025-03-08 06:50:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:50:34,914 INFO L471 AbstractCegarLoop]: Abstraction has 58905 states and 111274 transitions. [2025-03-08 06:50:34,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 58905 states and 111274 transitions. [2025-03-08 06:50:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 06:50:34,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:50:34,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:50:34,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:50:34,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:50:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:50:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash -624165016, now seen corresponding path program 1 times [2025-03-08 06:50:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:50:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287037152] [2025-03-08 06:50:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:50:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:50:34,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 06:50:34,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 06:50:34,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:50:34,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:50:35,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 06:50:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:50:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287037152] [2025-03-08 06:50:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287037152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:50:35,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:50:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:50:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275320305] [2025-03-08 06:50:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:50:35,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:50:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:50:35,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:50:35,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:50:35,050 INFO L87 Difference]: Start difference. First operand 58905 states and 111274 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:50:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:50:40,379 INFO L93 Difference]: Finished difference Result 190270 states and 386045 transitions. [2025-03-08 06:50:40,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:50:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 143 [2025-03-08 06:50:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:50:41,348 INFO L225 Difference]: With dead ends: 190270 [2025-03-08 06:50:41,349 INFO L226 Difference]: Without dead ends: 133503 [2025-03-08 06:50:41,469 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 06:50:41,470 INFO L435 NwaCegarLoop]: 4511 mSDtfsCounter, 4909 mSDsluCounter, 13564 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 18075 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:50:41,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 18075 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:50:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133503 states. [2025-03-08 06:50:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133503 to 128086. [2025-03-08 06:50:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128086 states, 115989 states have (on average 1.6883325142901482) internal successors, (195828), 122297 states have internal predecessors, (195828), 4247 states have call successors, (4247), 1542 states have call predecessors, (4247), 7848 states have return successors, (69783), 4502 states have call predecessors, (69783), 4247 states have call successors, (69783)