./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.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_label43+token_ring.08.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 db9df7d135a21d792e3a2ca832f85f7c7fc22de6655b2cb0ba03be5cd467b7e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:51:24,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:51:24,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:51:24,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:51:24,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:51:24,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:51:24,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:51:24,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:51:24,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:51:24,395 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:51:24,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:51:24,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:51:24,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:51:24,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:51:24,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:51:24,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:51:24,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:51:24,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:51:24,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:51:24,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:51:24,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:51:24,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:51:24,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:51:24,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:51:24,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:51:24,398 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 -> db9df7d135a21d792e3a2ca832f85f7c7fc22de6655b2cb0ba03be5cd467b7e3 [2025-03-08 06:51:24,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:51:24,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:51:24,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:51:24,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:51:24,642 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:51:24,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c [2025-03-08 06:51:25,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1effa4a36/8b728fbeb5b04e3d9399c857adb3e599/FLAG4b92fe5f6 [2025-03-08 06:51:26,461 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:51:26,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c [2025-03-08 06:51:26,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1effa4a36/8b728fbeb5b04e3d9399c857adb3e599/FLAG4b92fe5f6 [2025-03-08 06:51:26,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1effa4a36/8b728fbeb5b04e3d9399c857adb3e599 [2025-03-08 06:51:26,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:51:26,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:51:26,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:51:26,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:51:26,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:51:26,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:51:26" (1/1) ... [2025-03-08 06:51:26,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad48ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:26, skipping insertion in model container [2025-03-08 06:51:26,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:51:26" (1/1) ... [2025-03-08 06:51:27,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:51:28,218 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_label43+token_ring.08.cil-1.c[381679,381692] [2025-03-08 06:51:28,250 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_label43+token_ring.08.cil-1.c[383339,383352] [2025-03-08 06:51:28,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:51:28,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:51:29,043 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_label43+token_ring.08.cil-1.c[381679,381692] [2025-03-08 06:51:29,047 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_label43+token_ring.08.cil-1.c[383339,383352] [2025-03-08 06:51:29,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:51:29,120 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:51:29,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29 WrapperNode [2025-03-08 06:51:29,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:51:29,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:51:29,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:51:29,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:51:29,129 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:51:29" (1/1) ... [2025-03-08 06:51:29,188 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:51:29" (1/1) ... [2025-03-08 06:51:29,486 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-08 06:51:29,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:51:29,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:51:29,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:51:29,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:51:29,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,642 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:51:29,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:29,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:30,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:51:30,020 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:51:30,020 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:51:30,020 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:51:30,021 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (1/1) ... [2025-03-08 06:51:30,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:51:30,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:51:30,049 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:51:30,056 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:51:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:51:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:51:30,072 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:51:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:51:30,072 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:51:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:51:30,073 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:51:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:51:30,073 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:51:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:51:30,073 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:51:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:51:30,073 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:51:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:51:30,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:51:30,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:51:30,185 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:51:30,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:51:36,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:51:36,289 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:51:36,289 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:51:36,289 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:51:36,290 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:51:36,290 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:51:36,290 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:51:36,492 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-03-08 06:51:36,492 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:51:36,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:51:36,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:51:36,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:36 BoogieIcfgContainer [2025-03-08 06:51:36,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:51:36,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:51:36,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:51:36,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:51:36,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:51:26" (1/3) ... [2025-03-08 06:51:36,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4033fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:36, skipping insertion in model container [2025-03-08 06:51:36,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:29" (2/3) ... [2025-03-08 06:51:36,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4033fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:36, skipping insertion in model container [2025-03-08 06:51:36,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:36" (3/3) ... [2025-03-08 06:51:36,553 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.08.cil-1.c [2025-03-08 06:51:36,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:51:36,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.08.cil-1.c that has 7 procedures, 2463 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-08 06:51:36,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:51:36,670 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;@3cbce21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:51:36,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:51:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 2463 states, 2433 states have (on average 1.843403205918619) internal successors, (4485), 2435 states have internal predecessors, (4485), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 06:51:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:36,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:36,697 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] [2025-03-08 06:51:36,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1059960243, now seen corresponding path program 1 times [2025-03-08 06:51:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646778399] [2025-03-08 06:51:36,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:36,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:36,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:36,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:36,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:37,197 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:51:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646778399] [2025-03-08 06:51:37,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646778399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:37,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:37,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111276308] [2025-03-08 06:51:37,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:37,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:37,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:37,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:37,224 INFO L87 Difference]: Start difference. First operand has 2463 states, 2433 states have (on average 1.843403205918619) internal successors, (4485), 2435 states have internal predecessors, (4485), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (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:51:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:37,798 INFO L93 Difference]: Finished difference Result 5204 states and 9513 transitions. [2025-03-08 06:51:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:51:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:37,827 INFO L225 Difference]: With dead ends: 5204 [2025-03-08 06:51:37,827 INFO L226 Difference]: Without dead ends: 2687 [2025-03-08 06:51:37,838 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:51:37,841 INFO L435 NwaCegarLoop]: 4360 mSDtfsCounter, 4834 mSDsluCounter, 8899 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4850 SdHoareTripleChecker+Valid, 13259 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:37,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4850 Valid, 13259 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2025-03-08 06:51:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2666. [2025-03-08 06:51:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2612 states have (on average 1.812021439509954) internal successors, (4733), 2615 states have internal predecessors, (4733), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-08 06:51:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4812 transitions. [2025-03-08 06:51:37,979 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4812 transitions. Word has length 132 [2025-03-08 06:51:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:37,979 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4812 transitions. [2025-03-08 06:51:37,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (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:51:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4812 transitions. [2025-03-08 06:51:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:37,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:37,986 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] [2025-03-08 06:51:37,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:51:37,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -618390513, now seen corresponding path program 1 times [2025-03-08 06:51:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:37,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575821450] [2025-03-08 06:51:37,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:38,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:38,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:38,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:38,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:38,220 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:51:38,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:38,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575821450] [2025-03-08 06:51:38,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575821450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:38,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:38,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121541145] [2025-03-08 06:51:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:38,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:38,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:38,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:38,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:38,224 INFO L87 Difference]: Start difference. First operand 2666 states and 4812 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:38,550 INFO L93 Difference]: Finished difference Result 3249 states and 5745 transitions. [2025-03-08 06:51:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:38,563 INFO L225 Difference]: With dead ends: 3249 [2025-03-08 06:51:38,564 INFO L226 Difference]: Without dead ends: 2720 [2025-03-08 06:51:38,567 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:51:38,568 INFO L435 NwaCegarLoop]: 4279 mSDtfsCounter, 4533 mSDsluCounter, 8443 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4549 SdHoareTripleChecker+Valid, 12722 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:38,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4549 Valid, 12722 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2025-03-08 06:51:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2666. [2025-03-08 06:51:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2612 states have (on average 1.8112557427258806) internal successors, (4731), 2615 states have internal predecessors, (4731), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-08 06:51:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4810 transitions. [2025-03-08 06:51:38,647 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4810 transitions. Word has length 132 [2025-03-08 06:51:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:38,649 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4810 transitions. [2025-03-08 06:51:38,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4810 transitions. [2025-03-08 06:51:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:38,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:51:38,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:51:38,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -382712338, now seen corresponding path program 1 times [2025-03-08 06:51:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598207060] [2025-03-08 06:51:38,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:38,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:38,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:38,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:38,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:38,830 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:51:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598207060] [2025-03-08 06:51:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598207060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:38,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:38,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:38,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685469896] [2025-03-08 06:51:38,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:38,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:38,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:38,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:38,832 INFO L87 Difference]: Start difference. First operand 2666 states and 4810 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:39,474 INFO L93 Difference]: Finished difference Result 3534 states and 6188 transitions. [2025-03-08 06:51:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:39,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:39,487 INFO L225 Difference]: With dead ends: 3534 [2025-03-08 06:51:39,487 INFO L226 Difference]: Without dead ends: 3005 [2025-03-08 06:51:39,489 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:51:39,489 INFO L435 NwaCegarLoop]: 4508 mSDtfsCounter, 4761 mSDsluCounter, 13543 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 18051 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:39,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18051 Invalid, 846 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-03-08 06:51:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2916. [2025-03-08 06:51:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2838 states have (on average 1.7899929527836504) internal successors, (5080), 2842 states have internal predecessors, (5080), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-08 06:51:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 5196 transitions. [2025-03-08 06:51:39,556 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 5196 transitions. Word has length 132 [2025-03-08 06:51:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:39,556 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 5196 transitions. [2025-03-08 06:51:39,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 5196 transitions. [2025-03-08 06:51:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:39,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:39,558 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] [2025-03-08 06:51:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:51:39,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1206393809, now seen corresponding path program 1 times [2025-03-08 06:51:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878842957] [2025-03-08 06:51:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:39,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:39,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:39,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:39,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:39,701 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:51:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878842957] [2025-03-08 06:51:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878842957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:39,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:39,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982856906] [2025-03-08 06:51:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:39,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:39,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:39,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:39,703 INFO L87 Difference]: Start difference. First operand 2916 states and 5196 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:40,281 INFO L93 Difference]: Finished difference Result 4327 states and 7431 transitions. [2025-03-08 06:51:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:40,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:40,295 INFO L225 Difference]: With dead ends: 4327 [2025-03-08 06:51:40,295 INFO L226 Difference]: Without dead ends: 3548 [2025-03-08 06:51:40,298 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:51:40,299 INFO L435 NwaCegarLoop]: 4504 mSDtfsCounter, 4756 mSDsluCounter, 13531 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 18035 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:40,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 18035 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-03-08 06:51:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3447. [2025-03-08 06:51:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 3319 states have (on average 1.757457065381139) internal successors, (5833), 3327 states have internal predecessors, (5833), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-08 06:51:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 6029 transitions. [2025-03-08 06:51:40,387 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 6029 transitions. Word has length 132 [2025-03-08 06:51:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:40,387 INFO L471 AbstractCegarLoop]: Abstraction has 3447 states and 6029 transitions. [2025-03-08 06:51:40,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 6029 transitions. [2025-03-08 06:51:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:40,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:40,389 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] [2025-03-08 06:51:40,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:51:40,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash -124585522, now seen corresponding path program 1 times [2025-03-08 06:51:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461847257] [2025-03-08 06:51:40,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:40,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:40,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:40,517 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:51:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461847257] [2025-03-08 06:51:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461847257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:40,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:40,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983497576] [2025-03-08 06:51:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:40,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:40,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:40,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:40,518 INFO L87 Difference]: Start difference. First operand 3447 states and 6029 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:41,046 INFO L93 Difference]: Finished difference Result 6032 states and 10158 transitions. [2025-03-08 06:51:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:41,065 INFO L225 Difference]: With dead ends: 6032 [2025-03-08 06:51:41,065 INFO L226 Difference]: Without dead ends: 4722 [2025-03-08 06:51:41,071 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:51:41,072 INFO L435 NwaCegarLoop]: 4311 mSDtfsCounter, 4777 mSDsluCounter, 13075 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 17386 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:41,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 17386 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2025-03-08 06:51:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4596. [2025-03-08 06:51:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 4362 states have (on average 1.7177900045850527) internal successors, (7493), 4384 states have internal predecessors, (7493), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-08 06:51:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 7873 transitions. [2025-03-08 06:51:41,197 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 7873 transitions. Word has length 132 [2025-03-08 06:51:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:41,197 INFO L471 AbstractCegarLoop]: Abstraction has 4596 states and 7873 transitions. [2025-03-08 06:51:41,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 7873 transitions. [2025-03-08 06:51:41,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:41,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:41,200 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] [2025-03-08 06:51:41,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:51:41,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash -643877809, now seen corresponding path program 1 times [2025-03-08 06:51:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482515031] [2025-03-08 06:51:41,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:41,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:41,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:41,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:41,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482515031] [2025-03-08 06:51:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482515031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610983025] [2025-03-08 06:51:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:41,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:41,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:41,315 INFO L87 Difference]: Start difference. First operand 4596 states and 7873 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:42,064 INFO L93 Difference]: Finished difference Result 9771 states and 16312 transitions. [2025-03-08 06:51:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:42,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:42,097 INFO L225 Difference]: With dead ends: 9771 [2025-03-08 06:51:42,097 INFO L226 Difference]: Without dead ends: 7312 [2025-03-08 06:51:42,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:51:42,108 INFO L435 NwaCegarLoop]: 4498 mSDtfsCounter, 4746 mSDsluCounter, 13513 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4762 SdHoareTripleChecker+Valid, 18011 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:42,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4762 Valid, 18011 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7312 states. [2025-03-08 06:51:42,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7312 to 7137. [2025-03-08 06:51:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7137 states, 6673 states have (on average 1.6845496778060842) internal successors, (11241), 6741 states have internal predecessors, (11241), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-08 06:51:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 12085 transitions. [2025-03-08 06:51:42,388 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 12085 transitions. Word has length 132 [2025-03-08 06:51:42,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:42,388 INFO L471 AbstractCegarLoop]: Abstraction has 7137 states and 12085 transitions. [2025-03-08 06:51:42,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:42,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 12085 transitions. [2025-03-08 06:51:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:42,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:42,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:51:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:51:42,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:42,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1630460498, now seen corresponding path program 1 times [2025-03-08 06:51:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:42,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186458848] [2025-03-08 06:51:42,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:42,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:42,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:42,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:42,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:42,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:42,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186458848] [2025-03-08 06:51:42,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186458848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:42,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:42,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313966560] [2025-03-08 06:51:42,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:42,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:42,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:42,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:42,506 INFO L87 Difference]: Start difference. First operand 7137 states and 12085 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:43,242 INFO L93 Difference]: Finished difference Result 18162 states and 30698 transitions. [2025-03-08 06:51:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:43,308 INFO L225 Difference]: With dead ends: 18162 [2025-03-08 06:51:43,308 INFO L226 Difference]: Without dead ends: 13162 [2025-03-08 06:51:43,332 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:51:43,333 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 4741 mSDsluCounter, 13504 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4757 SdHoareTripleChecker+Valid, 17999 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:43,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4757 Valid, 17999 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13162 states. [2025-03-08 06:51:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13162 to 12894. [2025-03-08 06:51:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12894 states, 11916 states have (on average 1.6714501510574018) internal successors, (19917), 12130 states have internal predecessors, (19917), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-08 06:51:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22073 transitions. [2025-03-08 06:51:43,825 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22073 transitions. Word has length 132 [2025-03-08 06:51:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:43,825 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22073 transitions. [2025-03-08 06:51:43,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22073 transitions. [2025-03-08 06:51:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:43,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:43,831 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] [2025-03-08 06:51:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:51:43,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:43,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash -553907089, now seen corresponding path program 1 times [2025-03-08 06:51:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275838572] [2025-03-08 06:51:43,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:43,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:43,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:43,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:43,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:43,921 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:51:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275838572] [2025-03-08 06:51:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275838572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966066780] [2025-03-08 06:51:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:43,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:43,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:43,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:43,922 INFO L87 Difference]: Start difference. First operand 12894 states and 22073 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:44,402 INFO L93 Difference]: Finished difference Result 26591 states and 46398 transitions. [2025-03-08 06:51:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:44,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:44,460 INFO L225 Difference]: With dead ends: 26591 [2025-03-08 06:51:44,460 INFO L226 Difference]: Without dead ends: 15834 [2025-03-08 06:51:44,495 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:51:44,497 INFO L435 NwaCegarLoop]: 4266 mSDtfsCounter, 4525 mSDsluCounter, 8418 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4541 SdHoareTripleChecker+Valid, 12684 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:44,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4541 Valid, 12684 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15834 states. [2025-03-08 06:51:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15834 to 12894. [2025-03-08 06:51:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12894 states, 11916 states have (on average 1.6686807653575024) internal successors, (19884), 12130 states have internal predecessors, (19884), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-08 06:51:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22040 transitions. [2025-03-08 06:51:45,161 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22040 transitions. Word has length 132 [2025-03-08 06:51:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:45,162 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22040 transitions. [2025-03-08 06:51:45,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22040 transitions. [2025-03-08 06:51:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:45,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:45,170 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] [2025-03-08 06:51:45,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:51:45,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:45,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1281935758, now seen corresponding path program 1 times [2025-03-08 06:51:45,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:45,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470762103] [2025-03-08 06:51:45,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:45,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:45,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:45,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:45,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:45,266 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:51:45,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:45,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470762103] [2025-03-08 06:51:45,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470762103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:45,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:45,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:45,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71953973] [2025-03-08 06:51:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:45,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:45,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:45,267 INFO L87 Difference]: Start difference. First operand 12894 states and 22040 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:45,827 INFO L93 Difference]: Finished difference Result 26346 states and 45842 transitions. [2025-03-08 06:51:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:45,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:45,878 INFO L225 Difference]: With dead ends: 26346 [2025-03-08 06:51:45,878 INFO L226 Difference]: Without dead ends: 15589 [2025-03-08 06:51:45,901 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:51:45,903 INFO L435 NwaCegarLoop]: 4263 mSDtfsCounter, 4522 mSDsluCounter, 8413 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4538 SdHoareTripleChecker+Valid, 12676 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:45,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4538 Valid, 12676 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15589 states. [2025-03-08 06:51:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15589 to 12894. [2025-03-08 06:51:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12894 states, 11916 states have (on average 1.6659113796576033) internal successors, (19851), 12130 states have internal predecessors, (19851), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-08 06:51:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22007 transitions. [2025-03-08 06:51:46,315 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22007 transitions. Word has length 132 [2025-03-08 06:51:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:46,315 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22007 transitions. [2025-03-08 06:51:46,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22007 transitions. [2025-03-08 06:51:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:46,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:46,322 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] [2025-03-08 06:51:46,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:51:46,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:46,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1341156495, now seen corresponding path program 1 times [2025-03-08 06:51:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183155822] [2025-03-08 06:51:46,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:46,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:46,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:46,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:46,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:46,435 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:51:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183155822] [2025-03-08 06:51:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183155822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:46,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:46,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747551335] [2025-03-08 06:51:46,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:46,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:46,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:46,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:46,438 INFO L87 Difference]: Start difference. First operand 12894 states and 22007 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:47,697 INFO L93 Difference]: Finished difference Result 38865 states and 67435 transitions. [2025-03-08 06:51:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:47,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:47,827 INFO L225 Difference]: With dead ends: 38865 [2025-03-08 06:51:47,827 INFO L226 Difference]: Without dead ends: 28108 [2025-03-08 06:51:47,871 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:51:47,872 INFO L435 NwaCegarLoop]: 4480 mSDtfsCounter, 4974 mSDsluCounter, 13456 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4999 SdHoareTripleChecker+Valid, 17936 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:47,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4999 Valid, 17936 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28108 states. [2025-03-08 06:51:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28108 to 25689. [2025-03-08 06:51:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25689 states, 23553 states have (on average 1.669723602088906) internal successors, (39327), 24221 states have internal predecessors, (39327), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-08 06:51:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 45579 transitions. [2025-03-08 06:51:49,093 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 45579 transitions. Word has length 132 [2025-03-08 06:51:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:49,094 INFO L471 AbstractCegarLoop]: Abstraction has 25689 states and 45579 transitions. [2025-03-08 06:51:49,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 45579 transitions. [2025-03-08 06:51:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:49,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:49,103 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] [2025-03-08 06:51:49,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:51:49,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:49,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2035803502, now seen corresponding path program 1 times [2025-03-08 06:51:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570332975] [2025-03-08 06:51:49,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:49,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:49,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:49,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:49,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:49,188 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:51:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570332975] [2025-03-08 06:51:49,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570332975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:49,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688541777] [2025-03-08 06:51:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:49,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:49,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:49,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:49,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:49,190 INFO L87 Difference]: Start difference. First operand 25689 states and 45579 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:50,123 INFO L93 Difference]: Finished difference Result 55820 states and 102366 transitions. [2025-03-08 06:51:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:50,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:50,237 INFO L225 Difference]: With dead ends: 55820 [2025-03-08 06:51:50,237 INFO L226 Difference]: Without dead ends: 32268 [2025-03-08 06:51:50,285 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:51:50,287 INFO L435 NwaCegarLoop]: 4258 mSDtfsCounter, 4516 mSDsluCounter, 8402 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4532 SdHoareTripleChecker+Valid, 12660 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:50,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4532 Valid, 12660 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32268 states. [2025-03-08 06:51:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32268 to 25689. [2025-03-08 06:51:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25689 states, 23553 states have (on average 1.6669638687216066) internal successors, (39262), 24221 states have internal predecessors, (39262), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-08 06:51:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 45514 transitions. [2025-03-08 06:51:51,494 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 45514 transitions. Word has length 132 [2025-03-08 06:51:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:51,495 INFO L471 AbstractCegarLoop]: Abstraction has 25689 states and 45514 transitions. [2025-03-08 06:51:51,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 45514 transitions. [2025-03-08 06:51:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:51,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:51,504 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] [2025-03-08 06:51:51,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:51:51,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:51,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1128377169, now seen corresponding path program 1 times [2025-03-08 06:51:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757816423] [2025-03-08 06:51:51,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:51,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:51,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:51,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:51,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:51,593 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:51:51,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757816423] [2025-03-08 06:51:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757816423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:51,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:51,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:51,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618979757] [2025-03-08 06:51:51,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:51,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:51,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:51,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:51,595 INFO L87 Difference]: Start difference. First operand 25689 states and 45514 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:54,145 INFO L93 Difference]: Finished difference Result 81894 states and 151450 transitions. [2025-03-08 06:51:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:54,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:51:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:54,365 INFO L225 Difference]: With dead ends: 81894 [2025-03-08 06:51:54,365 INFO L226 Difference]: Without dead ends: 58342 [2025-03-08 06:51:54,427 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:51:54,428 INFO L435 NwaCegarLoop]: 4472 mSDtfsCounter, 4901 mSDsluCounter, 13433 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4926 SdHoareTripleChecker+Valid, 17905 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:54,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4926 Valid, 17905 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58342 states. [2025-03-08 06:51:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58342 to 54585. [2025-03-08 06:51:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54585 states, 49679 states have (on average 1.678777753175386) internal successors, (83400), 51741 states have internal predecessors, (83400), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-08 06:51:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103924 transitions. [2025-03-08 06:51:57,387 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103924 transitions. Word has length 132 [2025-03-08 06:51:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:57,388 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103924 transitions. [2025-03-08 06:51:57,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:51:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103924 transitions. [2025-03-08 06:51:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:51:57,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:57,405 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] [2025-03-08 06:51:57,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:51:57,405 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2061731506, now seen corresponding path program 1 times [2025-03-08 06:51:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515631444] [2025-03-08 06:51:57,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:57,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:51:57,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:51:57,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:57,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:57,481 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:51:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:57,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515631444] [2025-03-08 06:51:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515631444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:57,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888103798] [2025-03-08 06:51:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:57,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:57,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:57,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:57,484 INFO L87 Difference]: Start difference. First operand 54585 states and 103924 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:52:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:00,379 INFO L93 Difference]: Finished difference Result 122356 states and 244586 transitions. [2025-03-08 06:52:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:00,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:52:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:00,763 INFO L225 Difference]: With dead ends: 122356 [2025-03-08 06:52:00,763 INFO L226 Difference]: Without dead ends: 69908 [2025-03-08 06:52:01,055 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:52:01,056 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4523 mSDsluCounter, 8380 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4539 SdHoareTripleChecker+Valid, 12620 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:01,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4539 Valid, 12620 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69908 states. [2025-03-08 06:52:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69908 to 54585. [2025-03-08 06:52:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54585 states, 49679 states have (on average 1.6761810825499708) internal successors, (83271), 51741 states have internal predecessors, (83271), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-08 06:52:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103795 transitions. [2025-03-08 06:52:04,074 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103795 transitions. Word has length 132 [2025-03-08 06:52:04,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:04,074 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103795 transitions. [2025-03-08 06:52:04,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:52:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103795 transitions. [2025-03-08 06:52:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:52:04,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:04,090 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] [2025-03-08 06:52:04,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:52:04,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:04,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -567819057, now seen corresponding path program 1 times [2025-03-08 06:52:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310358709] [2025-03-08 06:52:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:04,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:52:04,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:52:04,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:04,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310358709] [2025-03-08 06:52:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310358709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274173180] [2025-03-08 06:52:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:04,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:04,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:04,150 INFO L87 Difference]: Start difference. First operand 54585 states and 103795 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:52:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:07,009 INFO L93 Difference]: Finished difference Result 120167 states and 239950 transitions. [2025-03-08 06:52:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:07,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:52:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:07,354 INFO L225 Difference]: With dead ends: 120167 [2025-03-08 06:52:07,354 INFO L226 Difference]: Without dead ends: 67719 [2025-03-08 06:52:07,525 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:52:07,526 INFO L435 NwaCegarLoop]: 4250 mSDtfsCounter, 4509 mSDsluCounter, 8388 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 12638 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:07,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 12638 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67719 states. [2025-03-08 06:52:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67719 to 54585. [2025-03-08 06:52:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54585 states, 49679 states have (on average 1.6735844119245555) internal successors, (83142), 51741 states have internal predecessors, (83142), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-08 06:52:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103666 transitions. [2025-03-08 06:52:11,525 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103666 transitions. Word has length 132 [2025-03-08 06:52:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:11,525 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103666 transitions. [2025-03-08 06:52:11,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:52:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103666 transitions. [2025-03-08 06:52:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:52:11,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:11,540 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] [2025-03-08 06:52:11,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:52:11,540 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:11,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1766554322, now seen corresponding path program 1 times [2025-03-08 06:52:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871091124] [2025-03-08 06:52:11,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:11,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:11,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:52:11,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:52:11,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:11,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:11,641 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:52:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871091124] [2025-03-08 06:52:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871091124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452059494] [2025-03-08 06:52:11,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:11,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:11,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:11,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:11,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:11,643 INFO L87 Difference]: Start difference. First operand 54585 states and 103666 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:52:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:17,317 INFO L93 Difference]: Finished difference Result 174124 states and 357224 transitions. [2025-03-08 06:52:17,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:17,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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 132 [2025-03-08 06:52:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:17,938 INFO L225 Difference]: With dead ends: 174124 [2025-03-08 06:52:17,939 INFO L226 Difference]: Without dead ends: 121676 [2025-03-08 06:52:18,053 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:52:18,054 INFO L435 NwaCegarLoop]: 4459 mSDtfsCounter, 4790 mSDsluCounter, 13396 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4815 SdHoareTripleChecker+Valid, 17855 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:18,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4815 Valid, 17855 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:52:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121676 states. [2025-03-08 06:52:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121676 to 117288. [2025-03-08 06:52:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117288 states, 105448 states have (on average 1.67667475912298) internal successors, (176802), 111756 states have internal predecessors, (176802), 3990 states have call successors, (3990), 1542 states have call predecessors, (3990), 7848 states have return successors, (69526), 4245 states have call predecessors, (69526), 3990 states have call successors, (69526) [2025-03-08 06:52:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117288 states to 117288 states and 250318 transitions. [2025-03-08 06:52:25,335 INFO L78 Accepts]: Start accepts. Automaton has 117288 states and 250318 transitions. Word has length 132 [2025-03-08 06:52:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:25,336 INFO L471 AbstractCegarLoop]: Abstraction has 117288 states and 250318 transitions. [2025-03-08 06:52:25,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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:52:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 117288 states and 250318 transitions. [2025-03-08 06:52:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:52:25,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:25,372 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] [2025-03-08 06:52:25,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:52:25,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1251033873, now seen corresponding path program 1 times [2025-03-08 06:52:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:25,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692527821] [2025-03-08 06:52:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:25,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:52:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:52:25,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:25,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:25,455 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:52:25,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692527821] [2025-03-08 06:52:25,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692527821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:25,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986604097] [2025-03-08 06:52:25,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:25,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:25,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:25,458 INFO L87 Difference]: Start difference. First operand 117288 states and 250318 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (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)