./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+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_label48+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 06a966cd103a9c61c8e9ebcc5255a2d5a7d1dd56b172674853cec63a372f0a43 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:58:45,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:58:45,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:58:45,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:58:45,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:58:45,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:58:45,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:58:45,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:58:45,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:58:45,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:58:45,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:58:45,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:58:45,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:58:45,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:58:45,606 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:58:45,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:58:45,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:58:45,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:58:45,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:58:45,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:58:45,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:58:45,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:58:45,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:58:45,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:58:45,610 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 -> 06a966cd103a9c61c8e9ebcc5255a2d5a7d1dd56b172674853cec63a372f0a43 [2025-03-08 06:58:45,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:58:45,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:58:45,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:58:45,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:58:45,871 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:58:45,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c [2025-03-08 06:58:47,066 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baea1dfaa/17b7665533d0468f84961744214153ad/FLAG8ce31d998 [2025-03-08 06:58:47,608 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:58:47,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c [2025-03-08 06:58:47,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baea1dfaa/17b7665533d0468f84961744214153ad/FLAG8ce31d998 [2025-03-08 06:58:48,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baea1dfaa/17b7665533d0468f84961744214153ad [2025-03-08 06:58:48,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:58:48,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:58:48,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:58:48,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:58:48,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:58:48,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:58:48" (1/1) ... [2025-03-08 06:58:48,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cda11c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:48, skipping insertion in model container [2025-03-08 06:58:48,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:58:48" (1/1) ... [2025-03-08 06:58:48,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:58:49,321 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_label48+token_ring.08.cil-1.c[375709,375722] [2025-03-08 06:58:49,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.08.cil-1.c[383339,383352] [2025-03-08 06:58:49,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:58:49,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:58:50,125 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_label48+token_ring.08.cil-1.c[375709,375722] [2025-03-08 06:58:50,132 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_label48+token_ring.08.cil-1.c[383339,383352] [2025-03-08 06:58:50,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:58:50,191 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:58:50,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50 WrapperNode [2025-03-08 06:58:50,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:58:50,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:58:50,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:58:50,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:58:50,199 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:58:50" (1/1) ... [2025-03-08 06:58:50,281 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:58:50" (1/1) ... [2025-03-08 06:58:50,588 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-08 06:58:50,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:58:50,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:58:50,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:58:50,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:58:50,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:50,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:50,634 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:50,703 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:58:50,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:50,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:50,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:50,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:50,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:51,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:51,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:58:51,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:58:51,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:58:51,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:58:51,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (1/1) ... [2025-03-08 06:58:51,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:58:51,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:58:51,163 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:58:51,168 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:58:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:58:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:58:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:58:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:58:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:58:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:58:51,184 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:58:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:58:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:58:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:58:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:58:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:58:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:58:51,280 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:58:51,282 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:58:57,621 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:58:57,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:58:57,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:58:57,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:58:57,623 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:58:57,623 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:58:57,623 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:58:57,933 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-03-08 06:58:57,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:58:57,988 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:58:57,988 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:58:57,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:58:57 BoogieIcfgContainer [2025-03-08 06:58:57,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:58:57,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:58:57,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:58:57,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:58:57,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:58:48" (1/3) ... [2025-03-08 06:58:57,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708a1197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:58:57, skipping insertion in model container [2025-03-08 06:58:57,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:58:50" (2/3) ... [2025-03-08 06:58:57,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708a1197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:58:57, skipping insertion in model container [2025-03-08 06:58:57,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:58:57" (3/3) ... [2025-03-08 06:58:57,996 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.08.cil-1.c [2025-03-08 06:58:58,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:58:58,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label48+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:58:58,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:58:58,098 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;@51401b97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:58:58,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:58:58,107 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:58:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:58:58,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:58:58,117 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:58:58,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:58:58,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:58:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1059960243, now seen corresponding path program 1 times [2025-03-08 06:58:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:58:58,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306041556] [2025-03-08 06:58:58,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:58:58,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:58:58,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:58:58,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:58,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:58,620 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:58:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:58:58,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306041556] [2025-03-08 06:58:58,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306041556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:58:58,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:58:58,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:58:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068517120] [2025-03-08 06:58:58,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:58:58,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:58:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:58:58,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:58:58,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:58:58,650 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:58:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:58:59,289 INFO L93 Difference]: Finished difference Result 5204 states and 9513 transitions. [2025-03-08 06:58:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:58:59,291 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:58:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:58:59,314 INFO L225 Difference]: With dead ends: 5204 [2025-03-08 06:58:59,314 INFO L226 Difference]: Without dead ends: 2687 [2025-03-08 06:58:59,323 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:58:59,326 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:58:59,327 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:58:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2025-03-08 06:58:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2666. [2025-03-08 06:58:59,435 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:58:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4812 transitions. [2025-03-08 06:58:59,451 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4812 transitions. Word has length 132 [2025-03-08 06:58:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:58:59,451 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4812 transitions. [2025-03-08 06:58:59,451 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:58:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4812 transitions. [2025-03-08 06:58:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:58:59,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:58:59,455 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:58:59,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:58:59,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:58:59,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:58:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash -618390513, now seen corresponding path program 1 times [2025-03-08 06:58:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:58:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030150823] [2025-03-08 06:58:59,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:58:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:58:59,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:58:59,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:58:59,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:58:59,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:58:59,651 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:58:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:58:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030150823] [2025-03-08 06:58:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030150823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:58:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:58:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:58:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350965336] [2025-03-08 06:58:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:58:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:58:59,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:58:59,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:58:59,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:58:59,657 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:59:00,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:00,031 INFO L93 Difference]: Finished difference Result 3249 states and 5745 transitions. [2025-03-08 06:59:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:00,031 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:59:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:00,042 INFO L225 Difference]: With dead ends: 3249 [2025-03-08 06:59:00,042 INFO L226 Difference]: Without dead ends: 2720 [2025-03-08 06:59:00,044 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:59:00,045 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:00,045 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.3s Time] [2025-03-08 06:59:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2025-03-08 06:59:00,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2666. [2025-03-08 06:59:00,107 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:59:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4810 transitions. [2025-03-08 06:59:00,121 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4810 transitions. Word has length 132 [2025-03-08 06:59:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:00,122 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4810 transitions. [2025-03-08 06:59:00,122 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:59:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4810 transitions. [2025-03-08 06:59:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:00,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:00,125 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:59:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:59:00,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -382712338, now seen corresponding path program 1 times [2025-03-08 06:59:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545075159] [2025-03-08 06:59:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:00,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:00,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:00,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:00,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:00,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:00,331 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:59:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545075159] [2025-03-08 06:59:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545075159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:00,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930566144] [2025-03-08 06:59:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:00,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:00,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:00,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:00,335 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:59:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:00,912 INFO L93 Difference]: Finished difference Result 3534 states and 6188 transitions. [2025-03-08 06:59:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:00,914 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:59:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:00,928 INFO L225 Difference]: With dead ends: 3534 [2025-03-08 06:59:00,928 INFO L226 Difference]: Without dead ends: 3005 [2025-03-08 06:59:00,931 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:59:00,932 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.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:00,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18051 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:59:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-03-08 06:59:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2916. [2025-03-08 06:59:00,990 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:59:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 5196 transitions. [2025-03-08 06:59:01,000 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 5196 transitions. Word has length 132 [2025-03-08 06:59:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:01,000 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 5196 transitions. [2025-03-08 06:59:01,000 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:59:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 5196 transitions. [2025-03-08 06:59:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:01,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:01,002 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:59:01,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:59:01,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:01,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1206393809, now seen corresponding path program 1 times [2025-03-08 06:59:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:01,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726336547] [2025-03-08 06:59:01,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:01,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:01,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:01,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:01,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:01,111 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:59:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:01,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726336547] [2025-03-08 06:59:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726336547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:01,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45865689] [2025-03-08 06:59:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:01,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:01,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:01,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:01,113 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:59:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:01,895 INFO L93 Difference]: Finished difference Result 4327 states and 7431 transitions. [2025-03-08 06:59:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:01,895 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:59:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:01,911 INFO L225 Difference]: With dead ends: 4327 [2025-03-08 06:59:01,911 INFO L226 Difference]: Without dead ends: 3548 [2025-03-08 06:59:01,915 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:59:01,916 INFO L435 NwaCegarLoop]: 4504 mSDtfsCounter, 4756 mSDsluCounter, 13531 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:01,916 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.7s Time] [2025-03-08 06:59:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-03-08 06:59:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3447. [2025-03-08 06:59:01,986 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:59:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 6029 transitions. [2025-03-08 06:59:01,998 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 6029 transitions. Word has length 132 [2025-03-08 06:59:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:01,998 INFO L471 AbstractCegarLoop]: Abstraction has 3447 states and 6029 transitions. [2025-03-08 06:59:01,998 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:59:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 6029 transitions. [2025-03-08 06:59:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:02,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:02,000 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:59:02,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:59:02,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:02,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:02,001 INFO L85 PathProgramCache]: Analyzing trace with hash -124585522, now seen corresponding path program 1 times [2025-03-08 06:59:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:02,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092421195] [2025-03-08 06:59:02,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:02,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:02,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:02,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:02,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:02,116 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:59:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092421195] [2025-03-08 06:59:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092421195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012167975] [2025-03-08 06:59:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:02,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:02,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:02,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:02,118 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:59:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:02,633 INFO L93 Difference]: Finished difference Result 6032 states and 10158 transitions. [2025-03-08 06:59:02,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:02,634 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:59:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:02,651 INFO L225 Difference]: With dead ends: 6032 [2025-03-08 06:59:02,651 INFO L226 Difference]: Without dead ends: 4722 [2025-03-08 06:59:02,657 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:59:02,658 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:59:02,658 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:59:02,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2025-03-08 06:59:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4596. [2025-03-08 06:59:02,796 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:59:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 7873 transitions. [2025-03-08 06:59:02,810 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 7873 transitions. Word has length 132 [2025-03-08 06:59:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:02,810 INFO L471 AbstractCegarLoop]: Abstraction has 4596 states and 7873 transitions. [2025-03-08 06:59:02,810 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:59:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 7873 transitions. [2025-03-08 06:59:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:02,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:02,816 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:59:02,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:59:02,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:02,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:02,818 INFO L85 PathProgramCache]: Analyzing trace with hash -643877809, now seen corresponding path program 1 times [2025-03-08 06:59:02,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463778668] [2025-03-08 06:59:02,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:02,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:02,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:02,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:02,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:02,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:02,946 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:59:02,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:02,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463778668] [2025-03-08 06:59:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463778668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:02,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:02,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640243805] [2025-03-08 06:59:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:02,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:02,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:02,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:02,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:02,949 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:59:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:03,552 INFO L93 Difference]: Finished difference Result 9771 states and 16312 transitions. [2025-03-08 06:59:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:03,553 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:59:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:03,586 INFO L225 Difference]: With dead ends: 9771 [2025-03-08 06:59:03,587 INFO L226 Difference]: Without dead ends: 7312 [2025-03-08 06:59:03,599 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:59:03,600 INFO L435 NwaCegarLoop]: 4498 mSDtfsCounter, 4746 mSDsluCounter, 13513 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:03,600 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.4s Time] [2025-03-08 06:59:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7312 states. [2025-03-08 06:59:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7312 to 7137. [2025-03-08 06:59:03,860 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:59:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 12085 transitions. [2025-03-08 06:59:03,880 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 12085 transitions. Word has length 132 [2025-03-08 06:59:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:03,881 INFO L471 AbstractCegarLoop]: Abstraction has 7137 states and 12085 transitions. [2025-03-08 06:59:03,881 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:59:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 12085 transitions. [2025-03-08 06:59:03,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:03,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:03,886 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:59:03,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:59:03,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:03,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1630460498, now seen corresponding path program 1 times [2025-03-08 06:59:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:03,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013671531] [2025-03-08 06:59:03,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:03,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:03,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:03,998 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:59:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:03,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013671531] [2025-03-08 06:59:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013671531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:03,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:03,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:03,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049803893] [2025-03-08 06:59:03,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:03,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:04,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:04,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:04,000 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:59:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:04,885 INFO L93 Difference]: Finished difference Result 18162 states and 30698 transitions. [2025-03-08 06:59:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:04,886 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:59:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:04,990 INFO L225 Difference]: With dead ends: 18162 [2025-03-08 06:59:04,990 INFO L226 Difference]: Without dead ends: 13162 [2025-03-08 06:59:05,036 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:59:05,037 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:59:05,037 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:59:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13162 states. [2025-03-08 06:59:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13162 to 12894. [2025-03-08 06:59:05,442 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:59:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22073 transitions. [2025-03-08 06:59:05,478 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22073 transitions. Word has length 132 [2025-03-08 06:59:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:05,478 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22073 transitions. [2025-03-08 06:59:05,479 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:59:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22073 transitions. [2025-03-08 06:59:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:05,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:05,488 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:59:05,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:59:05,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -553907089, now seen corresponding path program 1 times [2025-03-08 06:59:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984189836] [2025-03-08 06:59:05,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:05,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:05,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:05,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:05,582 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:59:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984189836] [2025-03-08 06:59:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984189836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:05,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101887196] [2025-03-08 06:59:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:05,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:05,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:05,585 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:59:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:06,123 INFO L93 Difference]: Finished difference Result 26591 states and 46398 transitions. [2025-03-08 06:59:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:06,124 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:59:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:06,174 INFO L225 Difference]: With dead ends: 26591 [2025-03-08 06:59:06,174 INFO L226 Difference]: Without dead ends: 15834 [2025-03-08 06:59:06,202 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:59:06,202 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:59:06,202 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:59:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15834 states. [2025-03-08 06:59:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15834 to 12894. [2025-03-08 06:59:06,722 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:59:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22040 transitions. [2025-03-08 06:59:06,805 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22040 transitions. Word has length 132 [2025-03-08 06:59:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:06,810 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22040 transitions. [2025-03-08 06:59:06,810 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:59:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22040 transitions. [2025-03-08 06:59:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:06,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:06,824 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:59:06,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:59:06,824 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:06,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1281935758, now seen corresponding path program 1 times [2025-03-08 06:59:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721330792] [2025-03-08 06:59:06,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:06,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:06,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:06,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:06,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:06,982 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:59:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:06,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721330792] [2025-03-08 06:59:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721330792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576110303] [2025-03-08 06:59:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:06,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:06,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:06,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:06,985 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:59:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:07,555 INFO L93 Difference]: Finished difference Result 26346 states and 45842 transitions. [2025-03-08 06:59:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:07,556 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:59:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:07,727 INFO L225 Difference]: With dead ends: 26346 [2025-03-08 06:59:07,727 INFO L226 Difference]: Without dead ends: 15589 [2025-03-08 06:59:07,751 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:59:07,754 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:59:07,754 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:59:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15589 states. [2025-03-08 06:59:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15589 to 12894. [2025-03-08 06:59:08,330 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:59:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22007 transitions. [2025-03-08 06:59:08,428 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22007 transitions. Word has length 132 [2025-03-08 06:59:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:08,434 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22007 transitions. [2025-03-08 06:59:08,434 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:59:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22007 transitions. [2025-03-08 06:59:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:08,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:08,458 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:59:08,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:59:08,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:08,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1341156495, now seen corresponding path program 1 times [2025-03-08 06:59:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:08,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172311949] [2025-03-08 06:59:08,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:08,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:08,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:08,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:08,639 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:59:08,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172311949] [2025-03-08 06:59:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172311949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:08,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:08,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684524850] [2025-03-08 06:59:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:08,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:08,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:08,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:08,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:08,640 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:59:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:09,790 INFO L93 Difference]: Finished difference Result 38865 states and 67435 transitions. [2025-03-08 06:59:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:09,790 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:59:09,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:09,900 INFO L225 Difference]: With dead ends: 38865 [2025-03-08 06:59:09,901 INFO L226 Difference]: Without dead ends: 28108 [2025-03-08 06:59:09,932 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:59:09,932 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:09,933 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.5s Time] [2025-03-08 06:59:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28108 states. [2025-03-08 06:59:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28108 to 25689. [2025-03-08 06:59:10,883 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:59:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 45579 transitions. [2025-03-08 06:59:11,104 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 45579 transitions. Word has length 132 [2025-03-08 06:59:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:11,109 INFO L471 AbstractCegarLoop]: Abstraction has 25689 states and 45579 transitions. [2025-03-08 06:59:11,109 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:59:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 45579 transitions. [2025-03-08 06:59:11,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:11,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:11,131 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:59:11,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:59:11,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:11,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2035803502, now seen corresponding path program 1 times [2025-03-08 06:59:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760834338] [2025-03-08 06:59:11,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:11,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:11,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:11,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:11,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:11,273 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:59:11,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:11,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760834338] [2025-03-08 06:59:11,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760834338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:11,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:11,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:11,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627440907] [2025-03-08 06:59:11,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:11,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:11,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:11,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:11,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:11,276 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:59:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:12,388 INFO L93 Difference]: Finished difference Result 55820 states and 102366 transitions. [2025-03-08 06:59:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:12,388 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:59:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:12,511 INFO L225 Difference]: With dead ends: 55820 [2025-03-08 06:59:12,512 INFO L226 Difference]: Without dead ends: 32268 [2025-03-08 06:59:12,565 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:59:12,565 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:59:12,565 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:59:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32268 states. [2025-03-08 06:59:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32268 to 25689. [2025-03-08 06:59:14,133 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:59:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 45514 transitions. [2025-03-08 06:59:14,209 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 45514 transitions. Word has length 132 [2025-03-08 06:59:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:14,209 INFO L471 AbstractCegarLoop]: Abstraction has 25689 states and 45514 transitions. [2025-03-08 06:59:14,209 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:59:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 45514 transitions. [2025-03-08 06:59:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:14,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:14,219 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:59:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:59:14,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:14,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1128377169, now seen corresponding path program 1 times [2025-03-08 06:59:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790587469] [2025-03-08 06:59:14,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:14,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:14,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:14,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:14,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:14,316 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:59:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790587469] [2025-03-08 06:59:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790587469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085725679] [2025-03-08 06:59:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:14,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:14,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:14,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:14,318 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:59:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:16,492 INFO L93 Difference]: Finished difference Result 81894 states and 151450 transitions. [2025-03-08 06:59:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:16,492 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:59:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:16,718 INFO L225 Difference]: With dead ends: 81894 [2025-03-08 06:59:16,718 INFO L226 Difference]: Without dead ends: 58342 [2025-03-08 06:59:16,790 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:59:16,791 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:59:16,792 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:59:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58342 states. [2025-03-08 06:59:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58342 to 54585. [2025-03-08 06:59:19,683 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:59:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103924 transitions. [2025-03-08 06:59:19,902 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103924 transitions. Word has length 132 [2025-03-08 06:59:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:19,903 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103924 transitions. [2025-03-08 06:59:19,903 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:59:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103924 transitions. [2025-03-08 06:59:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:19,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:19,920 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:59:19,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:59:19,921 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:19,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2061731506, now seen corresponding path program 1 times [2025-03-08 06:59:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52911886] [2025-03-08 06:59:19,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:19,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:19,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:19,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:19,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:20,015 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:59:20,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:20,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52911886] [2025-03-08 06:59:20,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52911886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:20,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:20,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926658593] [2025-03-08 06:59:20,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:20,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:20,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:20,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:20,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:20,017 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:59:22,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:22,675 INFO L93 Difference]: Finished difference Result 122356 states and 244586 transitions. [2025-03-08 06:59:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:22,676 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:59:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:23,012 INFO L225 Difference]: With dead ends: 122356 [2025-03-08 06:59:23,013 INFO L226 Difference]: Without dead ends: 69908 [2025-03-08 06:59:23,170 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:59:23,171 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:59:23,171 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:59:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69908 states. [2025-03-08 06:59:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69908 to 54585. [2025-03-08 06:59:26,261 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:59:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103795 transitions. [2025-03-08 06:59:26,497 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103795 transitions. Word has length 132 [2025-03-08 06:59:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:26,498 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103795 transitions. [2025-03-08 06:59:26,498 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:59:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103795 transitions. [2025-03-08 06:59:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:26,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:26,516 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:59:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:59:26,517 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:26,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash -567819057, now seen corresponding path program 1 times [2025-03-08 06:59:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579446333] [2025-03-08 06:59:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:26,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:26,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:26,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:26,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:26,787 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:59:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579446333] [2025-03-08 06:59:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579446333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:26,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:26,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136304592] [2025-03-08 06:59:26,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:26,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:26,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:26,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:26,790 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:59:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:29,955 INFO L93 Difference]: Finished difference Result 120167 states and 239950 transitions. [2025-03-08 06:59:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:29,956 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:59:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:30,271 INFO L225 Difference]: With dead ends: 120167 [2025-03-08 06:59:30,271 INFO L226 Difference]: Without dead ends: 67719 [2025-03-08 06:59:30,404 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:59:30,405 INFO L435 NwaCegarLoop]: 4250 mSDtfsCounter, 4509 mSDsluCounter, 8388 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:59:30,405 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:59:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67719 states. [2025-03-08 06:59:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67719 to 54585. [2025-03-08 06:59:33,898 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:59:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103666 transitions. [2025-03-08 06:59:34,240 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103666 transitions. Word has length 132 [2025-03-08 06:59:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:34,241 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103666 transitions. [2025-03-08 06:59:34,241 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:59:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103666 transitions. [2025-03-08 06:59:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:34,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:34,259 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:59:34,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:59:34,259 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:34,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1766554322, now seen corresponding path program 1 times [2025-03-08 06:59:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921130266] [2025-03-08 06:59:34,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:34,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:34,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:34,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:34,369 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:59:34,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:34,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921130266] [2025-03-08 06:59:34,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921130266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:34,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:34,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:34,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316617368] [2025-03-08 06:59:34,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:34,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:34,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:34,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:34,371 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:59:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:39,589 INFO L93 Difference]: Finished difference Result 174124 states and 357224 transitions. [2025-03-08 06:59:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:39,589 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:59:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:40,182 INFO L225 Difference]: With dead ends: 174124 [2025-03-08 06:59:40,182 INFO L226 Difference]: Without dead ends: 121676 [2025-03-08 06:59:40,388 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:59:40,388 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:59:40,389 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:59:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121676 states. [2025-03-08 06:59:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121676 to 117288. [2025-03-08 06:59:46,934 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:59:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117288 states to 117288 states and 250318 transitions. [2025-03-08 06:59:47,517 INFO L78 Accepts]: Start accepts. Automaton has 117288 states and 250318 transitions. Word has length 132 [2025-03-08 06:59:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:47,517 INFO L471 AbstractCegarLoop]: Abstraction has 117288 states and 250318 transitions. [2025-03-08 06:59:47,517 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:59:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 117288 states and 250318 transitions. [2025-03-08 06:59:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:59:47,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:47,546 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:59:47,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:59:47,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1251033873, now seen corresponding path program 1 times [2025-03-08 06:59:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156621953] [2025-03-08 06:59:47,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:47,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:59:47,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:59:47,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:47,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:47,611 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:59:47,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:47,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156621953] [2025-03-08 06:59:47,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156621953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:47,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:47,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4683206] [2025-03-08 06:59:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:47,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:47,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:47,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:47,612 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)